This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
all_pairs_dijkstra_path(G, cutoff=None, weight='weight')¶
Compute shortest paths between all nodes in a weighted graph.
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
Dictionary, keyed by source and target, of shortest paths.
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.
>>> G=nx.path_graph(5) >>> path=nx.all_pairs_dijkstra_path(G) >>> print(path) [0, 1, 2, 3, 4]