Re: [igraph] Traversing edges in sorted order

[Tamás Nepusz]

> I can afford the time to presort the edge indices for every node once as you 
> suggest. I just wanted to avoid using the space to store all the edges twice. 
> Once in the normal igraph graph and once in a sorted list labeling each 
> vertex.  It seems that you are effectively representing the same graph twice 
> if you do that.
Yes, it is indeed the case, but igraph's data structures are not optimized for 
the type of query that you want to perform so there's no way around that (apart 
from changing igraph's internal data structures of course)

-- 
T.