networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length

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

Compute the shortest path length between source and all other reachable nodes for a weighted graph.

Parameters :

G : NetworkX graph

source : node label

Starting node for path

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 :

length : dictionary

Dictionary of shortest lengths keyed by target.

See also

single_source_dijkstra

Notes

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

Examples

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