networkx.algorithms.shortest_paths.weighted.bellman_ford_path¶
- bellman_ford_path(G, source, target, weight='weight')[source]¶
Returns the shortest path from source to target in a weighted graph G.
- Parameters
- GNetworkX graph
- sourcenode
Starting node
- targetnode
Ending node
- weight: string, optional (default=’weight’)
Edge data key corresponding to the edge weight
- Returns
- pathlist
List of nodes in a shortest path.
- Raises
- NodeNotFound
If
source
is not inG
.- NetworkXNoPath
If no path exists between source and target.
See also
Notes
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.
Examples
>>> G = nx.path_graph(5) >>> print(nx.bellman_ford_path(G, 0, 4)) [0, 1, 2, 3, 4]