Warning

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

# all_pairs_dijkstra_path¶

all_pairs_dijkstra_path(G, cutoff=None, weight='weight')[source]

Compute shortest paths between all nodes in a weighted graph.

Parameters: G (NetworkX graph) – weight (string, optional (default='weight')) – Edge data key corresponding to the edge weight cutoff (integer or float, optional) – Depth to stop the search. Only paths of length <= cutoff are returned. distance – Dictionary, keyed by source and target, of shortest paths. dictionary

Examples

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


Notes

Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.

floyd_warshall()