|
Boost Users : |
From: Paul Davis (pjdavis_at_[hidden])
Date: 2006-09-09 01:02:01
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 <eric.fowler_at_[hidden]> wrote:
>
> 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_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>
>
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net