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.
- Distinct for indices, is it good library Api? b3liever
- Re: Distinct for indices, is it good library Api? mashingan
- Re: Distinct for indices, is it good library Api? b3liever
- Re: Distinct for indices, is it good library Api? dawkot
- Re: Distinct for indices, is it good library Ap... b3liever
- Re: Distinct for indices, is it good libra... mashingan
- Re: Distinct for indices, is it good l... b3liever
