Warning

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

all_pairs_shortest_path

all_pairs_shortest_path(G, cutoff=None)[source]

Compute shortest paths between all nodes.

Parameters:
  • G (NetworkX graph) –
  • cutoff (integer, optional) – Depth at which to stop the search. Only paths of length at most cutoff are returned.
Returns:

lengths – Dictionary, keyed by source and target, of shortest paths.
Return type:

dictionary

Examples

>>> G = nx.path_graph(5)
>>> path = nx.all_pairs_shortest_path(G)
>>> print(path[0][4])
[0, 1, 2, 3, 4]

See also

floyd_warshall()