It were better if LEDA lists could sup****t fast backtracking for lists
a-la-Knuth, i.e.
L(R(x))=L(x)
R(L(x))=R(x)
removes the element from the list (but not from memory)
and
L(R(x))=x
R(L(x))=x
puts the element back into list again. I need it and have to implement
this. Is there anything else my procedure has to do (update some
counters, memory management of some kind, etc...)?
Or maybe smb. has already done it (maybe in some other lib)? I don't
want to invent the wheel for the 100th time.
--
Best regards,
Alex.
PS. To email me, remove "loeschedies" from the email address given.
