networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path

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

Compute shortest paths between all nodes in a weighted graph.

Parameters :

G : NetworkX graph

weight: string, optional :

Edge data key corresponding to the edge weight

Returns :

distance : dictionary

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

See also

floyd_warshall

Examples

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