networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length

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

Compute 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 :

Edge data key corresponding to the edge weight

Returns :

paths : dictionary

Dictionary of shortest paths keyed by target.

See also

single_source_dijkstra

Notes

Edge data must be numerical values for XGraph and XDiGraphs.

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}