9.7.6.7. networkx.algorithms.shortest_paths.weighted.dijkstra_path¶

networkx.algorithms.shortest_paths.weighted.dijkstra_path(G, source, target, weight='weight')[source]¶

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

Uses Dijkstra’s Method to compute the shortest weighted path between two nodes in a graph.

Parameters:	G : NetworkX graph source : node Starting node target : node Ending node weight : string or function If this is a string, then edge weights will be accessed via the edge attribute with this key (that is, the weight of the edge joining u to v will be G.edge[u][v][weight]). If no such edge attribute exists, the weight of the edge is assumed to be one. If this is a function, the weight of an edge is the value returned by the function. The function must accept exactly three positional arguments: the two endpoints of an edge and the dictionary of edge attributes for that edge. The function must return a number.
Returns:	path : list List of nodes in a shortest path.
Raises:	NetworkXNoPath If no path exists between source and target.

See also

bidirectional_dijkstra, bellman_ford_path

Notes

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

The weight function can be used to hide edges by returning None. So weight = lambda u, v, d: 1 if d['color']=="red" else None will find the shortest red path.

Examples

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