Now I get it thanks, I've seen a couple of ways to model an adjacency list, but 
I think this must be the most efficient. Actually it models a doubly linked 
list with indices, there is no need for a seq, it has no limitations. You can 
see how the example at the end represented in memory, take a look at the 
commented output.

Reply via email to