Boost logo

Boost Users :

Subject: Re: [Boost-users] Get results of graph cut?
From: David Doria (daviddoria+boost_at_[hidden])
Date: 2009-09-13 20:33:05


On Fri, Sep 11, 2009 at 10:29 PM, David Doria
<daviddoria+boost_at_[hidden]<daviddoria%2Bboost_at_[hidden]>
> wrote:

> If I do this:
> double flow = kolmogorov_max_flow(g, SourceNode, SinkNode);
>
> I get the value of the max flow, but how do I tell which nodes of g belong
> to the "source side" of the graph and which nodes belong to the "sink side"?
> (thinking of it as a min cut rather than a max flow problem)
>
> Also, is it possible to tell the max flow algorithm to use multiple
> sources/sinks?
>
> Thanks,
>
> David
>

Does no one do this?? It seems like a very standard thing to want to do with
a graph, no?

Thanks,

David



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