Widest path algorithm in networkx

[Mufaddal Makati]

Hello,

I am using networkx apis for my university project. I have a weighted undirected graph. However I need to use the widest path algorithm on this graph between two nodes but I can't find any such algorithm in the networkx apis/documentation. Please let me know if you have such an algorithm maybe under a different name or even a similar one.

If not does anyone know if such an algorithm has been implemented by any other apis in python?

[Daniel Schult]

This first reference on the wikipedia webpage your email points to describes how shortest-path algorithms can be used to compute widest paths. I didn't read it, but believe the idea is to create new edge weights that are 1/(old weights) and then use shortest_path with the new weights. But don't take my word for it. Read the article. 

:)

--
You received this message because you are subscribed to the Google Groups "networkx-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to networkx-discu...@googlegroups.com.
To post to this group, send email to networkx...@googlegroups.com.
Visit this group at https://groups.google.com/group/networkx-discuss.
For more options, visit https://groups.google.com/d/optout.