This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
- all_pairs_shortest_path(G, cutoff=None)¶
Compute shortest paths between all nodes.
G : NetworkX graph
cutoff : integer, optional
Depth to stop the search. Only paths of length <= cutoff are returned.
lengths : dictionary
Dictionary, keyed by source and target, of shortest paths.
>>> G=nx.path_graph(5) >>> path=nx.all_pairs_shortest_path(G) >>> print(path) [0, 1, 2, 3, 4]