Get results of graph cut?
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
On Fri, Sep 11, 2009 at 10:29 PM, David Doria
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
Is there somewhere else (another list, perhaps) that I should be asking this kind of thing?
Sorry, I've been hoping that somebody who actually solved this problem would respond, but that doesn't seem to have happened. I think this question was asked a while ago, but I don't recall if there was ever a viable solution. I don't have any specific knowledge of the algorithm or its implementation, so I can't really be of any help. A cursory look at the docs, and I would say that it cannot be done with the current implementation. It might be worthwhile copying the original and simply modifying it to record cuts. It does not appear that the implementation will work with multiple sinks or sources. Andrew Sutton andrew.n.sutton@gmail.com
On Tue, Sep 15, 2009 at 11:01 AM, Andrew Sutton
Is there somewhere else (another list, perhaps) that I should be asking
this kind of thing?
Sorry, I've been hoping that somebody who actually solved this problem would respond, but that doesn't seem to have happened. I think this question was asked a while ago, but I don't recall if there was ever a viable solution. I don't have any specific knowledge of the algorithm or its implementation, so I can't really be of any help.
A cursory look at the docs, and I would say that it cannot be done with the current implementation. It might be worthwhile copying the original and simply modifying it to record cuts.
It does not appear that the implementation will work with multiple sinks or sources.
Andrew Sutton andrew.n.sutton@gmail.com
Thanks for looking Andrew. I didn't realize there was a boost list separate from the boost-users list. It sounds like more of a devel list? Maybe I'll forward this along to there and see if anything comes out of it. I just really don't think my programming skills are up to the task of modifying the BGL code myself. Thanks, David
participants (2)
-
Andrew Sutton -
David Doria