This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
single_source_dijkstra_path(G, source, cutoff=None, weight='weight')¶
Compute shortest path between source and all other reachable nodes for a weighted graph.
G : NetworkX graph
source : node
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.
paths : dictionary
Dictionary of shortest path lengths keyed by target.
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.
>>> G=nx.path_graph(5) >>> path=nx.single_source_dijkstra_path(G,0) >>> path [0, 1, 2, 3, 4]