<br><div class="gmail_quote">On Fri, Sep 11, 2009 at 10:29 PM, David Doria <span dir="ltr">&lt;<a href="mailto:daviddoria%2Bboost@gmail.com">daviddoria+boost@gmail.com</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
If I do this:<br>double flow = kolmogorov_max_flow(g, SourceNode, SinkNode);<br><br>I get the value of the max flow, but how do I tell which nodes of g belong to the &quot;source side&quot; of the graph and which nodes belong to the &quot;sink side&quot;? (thinking of it as a min cut rather than a max flow problem)<br>

<br>Also, is it possible to tell the max flow algorithm to use multiple sources/sinks?<br><br clear="all">Thanks,<br><font color="#888888"><br>David<br>
</font></blockquote></div><br>Does no one do this?? It seems like a very standard thing to want to do with a graph, no?<br><br clear="all">Thanks,<br><br>David<br>