Hi Tiago and everyone else on the list
Thank you for your swift reply. The attached png is one example of a max flow calculation result. The flow is limited in four places in this graph. I would like to extract the order of the edges in the four paths I drew.
The shortest path solution you described corresponds to path 3 in the drawing. all_shortest_paths gives my path 3 and another completely different path before crashing with a memoryError.
Looking forward to hearing from you. Best,
Alex ________________________________________ From: Tiago de Paula Peixoto [firstname.lastname@example.org] Sent: Thursday, March 09, 2017 18:43 To: Hobé Alex Subject: Re: Graphtool: Finding the paths that the maximum flow algorithm produces
I'm not sure I understand what you want. Any path containing edges with positive flow is a "flow path". There are many of them. Which one do you want? If you just want _some_ path, just filter out the edges with zero flow and get the shortest path. But there are many other ways to proceed...
PS. There is a mailing list of the graph-tool project, where questions like this can be posted. It is better to use the list than to ask me directly, since it builds a repository of questions others can consult, and other people can help you as well.
On 09.03.2017 17:04, Hobé Alex wrote:
Dear Mr. de Paula Peixoto
I am using the python graphtool for my master thesis and am enjoying the beautiful pictures it produces. When computing the maximum flow I would like to use other edge properties along the computed path for further calculations. I am therefore looking for a way to find an array, which contains the edges along a flow path, similar to the shortest_path result. I looked through all the pages of the online tutorial, learnt a couple of new tricks, but haven't found a way to solve this.
I would be very thankful for any assistance you would be able to provide and I look forward to hearing from you. Best wishes,
-- Tiago de Paula Peixoto email@example.com