Wouldn't be the most efficient, but you could store a reference to each
edge in a standard container and then sort the container.<br><br><div><span class="gmail_quote">On 9/8/06, <b class="gmail_sendername">Eric Fowler</b> &lt;<a href="mailto:eric.fowler@gmail.com">eric.fowler@gmail.com</a>&gt; wrote:
</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><div>Title says it all, I have a graph with weighted edges, and want to iterate through them in order of weights. 
<br><br>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. <br><br>A brief example would help. <br><br>Thanks. <br></div><div><span class="sg"><br>Eric<br>


</span></div><br>_______________________________________________<br>Boost-users mailing list<br><a onclick="return top.js.OpenExtLink(window,event,this)" href="mailto:Boost-users@lists.boost.org">Boost-users@lists.boost.org
</a><br><a onclick="return top.js.OpenExtLink(window,event,this)" href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost-users</a><br><br></blockquote>
</div><br>