networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path

networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path(G, cutoff=None, weight='weight')

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.

Returns :

distance : dictionary

Dictionary, keyed by source and target, of shortest paths.

See also

floyd_warshall

Notes

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

Examples

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