This documents the development version of NetworkX. Documentation for the current release can be found here.
bellman_ford_path_length(G, source, target, weight='weight')¶
Returns the shortest path length from source to target in a weighted graph.
- GNetworkX graph
- sourcenode label
starting node for path
- targetnode label
ending node for path
- weight: string, optional (default=’weight’)
Edge data key corresponding to the edge weight
Shortest path length.
sourceis not in
If no path exists between source and target.
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.
>>> G = nx.path_graph(5) >>> print(nx.bellman_ford_path_length(G, 0, 4)) 4