Hi Tiago
I guess I need to be a little clearer on what I am trying to achieve. The previous image has 41 possible paths according to the graph tool (using all_paths). I have now been able to reduce these to 6 by removing all of the edges with a weight of 0.0 (attached png).
I am setting the flow through each path as the minimum weight encountered on that path. When I then sum over each path, the total flow should equal to the max flow result.
When I sum over the six paths obtained, I get a too high result. Using the rules I just described, the paths 1-4 add up to the desired result.
I apologize for not including the code. I would have to create something new that does not include my research.
Thank you for your help. Best,
Alex
________________________________________ From: graph-tool [graph-tool-bounces@skewed.de] on behalf of Tiago de Paula Peixoto [tiago@skewed.de] Sent: Friday, March 10, 2017 16:55 To: graph-tool@skewed.de Subject: Re: [graph-tool] FW: Graphtool: Finding the paths that the maximum flow algorithm produces
On 10.03.2017 15:50, Tiago de Paula Peixoto wrote:
I'll have to trust you. It is not possible to tell from the image that there are only four possible paths.
Looking again at your image, since two of your paths cross in the node in the middle, there is definitely more than four possible paths...
-- Tiago de Paula Peixoto tiago@skewed.de
