Murali-group / PathLinker

Connect the dots in networks.
GNU General Public License v3.0
17 stars 10 forks source link

Function to compute k shortest paths and return a NetworkX object #1

Open annaritz opened 8 years ago

annaritz commented 8 years ago

Function request from one of my students:

k_shortest_paths(networkx_graph, k)

The function will take a NetworkX graph (possibly weighted) and a k and return a list of paths, where each path is represented as a NetworkX object. Perhaps an optional parameter (e.g., output_paths='list') will return the paths as a list.