Corrections to “Routing on longest-matching prefixes”

92 /* DelChain: Delete chain nodes */ /*DelChain: Delete chain nodes */ elseif (ChainNode(node))then elseif (ChainNode(node))then if (node 6= Root) if (node 6= Root) SubTrie(Parent(node),key) :=SubTrie(node,key) SubTrie(Parent(node),key) :=ClosestSubTrie (node,key) Parent(SubTrie(node,key)) :=Parent(node) Parent(ClosestSubTrie (node,key)) :=Parent(node) collnode :=SubTrie(node,key) collnode :=ClosestSubTrie (node,key) else else Root := SubTrie(node,key) Root := ClosestSubTrie (Root,key)