This documents the development version of NetworkX. Documentation for the current release can be found here.
Compute shortest paths between all nodes.
- GNetworkX graph
- cutoffinteger, optional
Depth at which to stop the search. Only paths of length at most
Dictionary, keyed by source and target, of shortest paths.
>>> G = nx.path_graph(5) >>> path = dict(nx.all_pairs_shortest_path(G)) >>> print(path) [0, 1, 2, 3, 4]