networkx.algorithms.shortest_paths.weighted.dijkstra_path_length

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

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

Parameters :

G : NetworkX graph

source : node label

starting node for path

target : node label

ending node for path

weight: string, optional (default=’weight’) :

Edge data key corresponding to the edge weight

Returns :

length : number

Shortest path length.

Raises :

NetworkXNoPath :

If no path exists between source and target.

See also

bidirectional_dijkstra

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_length(G,0,4))
4