single_source_dijkstra_path(G, source, cutoff=None, weight='weight')¶
Compute shortest path between source and all other reachable nodes for a weighted graph.
paths – Dictionary of shortest path lengths keyed by target.
>>> G=nx.path_graph(5) >>> path=nx.single_source_dijkstra_path(G,0) >>> path [0, 1, 2, 3, 4]
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.