9 Sep
2006
9 Sep
'06
5:02 a.m.
Wouldn't be the most efficient, but you could store a reference to each edge
in a standard container and then sort the container.
On 9/8/06, Eric Fowler
Title says it all, I have a graph with weighted edges, and want to iterate through them in order of weights.
To make it more interesting the edges are defined with setS and must be - actually, I could work around - but it would be more convenient to keep setS.
A brief example would help.
Thanks.
Eric
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users