Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
all_shortest_paths¶

all_shortest_paths
(G, source, target, weight=None)[source]¶ Compute all shortest paths in the graph.
Parameters:  G (NetworkX graph) –
 source (node) – Starting node for path.
 target (node) – Ending node for path.
 weight (None or string, optional (default = None)) – If None, every edge has weight/distance/cost 1. If a string, use this edge attribute as the edge weight. Any edge attribute not present defaults to 1.
Returns: paths – A generator of all paths between source and target.
Return type: generator of lists
Examples
>>> G=nx.Graph() >>> G.add_path([0,1,2]) >>> G.add_path([0,10,2]) >>> print([p for p in nx.all_shortest_paths(G,source=0,target=2)]) [[0, 1, 2], [0, 10, 2]]
Notes
There may be many shortest paths between the source and target.
See also
shortest_path()
,single_source_shortest_path()
,all_pairs_shortest_path()