networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path_length

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

Compute shortest path lengths 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 path lengths.

Notes

The dictionary returned only has keys for reachable node pairs.

Examples

>>> G=nx.path_graph(5)
>>> length=nx.all_pairs_dijkstra_path_length(G)
>>> print(length[1][4])
3
>>> length[1]
{0: 1, 1: 0, 2: 1, 3: 2, 4: 3}