Warning

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

# dijkstra_path¶

dijkstra_path(G, source, target, weight='weight')[source]

Returns the shortest path from source to target in a weighted graph G.

Parameters : G : NetworkX graph source : node Starting node target : node Ending node weight: string, optional (default=’weight’) Edge data key corresponding to the edge weight path : list List of nodes in a shortest path. NetworkXNoPath If no path exists between source and target.

Notes

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

Examples

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