Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

# single_source_dijkstra_path_length¶

single_source_dijkstra_path_length(G, source, cutoff=None, weight='weight')[source]

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. length – Dictionary of shortest lengths keyed by target. dictionary

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}


Notes

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