networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path

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

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

Parameters :

G : NetworkX graph

source : node

Starting node for path.

weight: string, optional :

Edge data key corresponding to the edge weight

Returns :

paths : dictionary

Dictionary of shortest path lengths keyed by target.

See also

single_source_dijkstra

Notes

Edge weight attributes must be numerical.

Examples

>>> G=nx.path_graph(5)
>>> path=nx.single_source_dijkstra_path(G,0)
>>> path[4]
[0, 1, 2, 3, 4]