networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path¶
- single_source_bellman_ford_path(G, source, weight='weight')[source]¶
Compute shortest path between source and all other reachable nodes for a weighted graph.
- Parameters
- GNetworkX graph
- sourcenode
Starting node for path.
- weight: string, optional (default=’weight’)
Edge data key corresponding to the edge weight
- Returns
- pathsdictionary
Dictionary of shortest path lengths keyed by target.
- Raises
- NodeNotFound
If
source
is not inG
.
Notes
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.
Examples
>>> G = nx.path_graph(5) >>> path = nx.single_source_bellman_ford_path(G, 0) >>> path[4] [0, 1, 2, 3, 4]