networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path¶
- all_pairs_bellman_ford_path(G, weight='weight')[source]¶
Compute shortest paths between all nodes in a weighted graph.
- Parameters
- GNetworkX graph
- weight: string, optional (default=’weight’)
Edge data key corresponding to the edge weight
- Returns
- distancedictionary
Dictionary, keyed by source and target, of shortest paths.
See also
floyd_warshall
,all_pairs_dijkstra_path
Notes
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.
Examples
>>> G = nx.path_graph(5) >>> path = dict(nx.all_pairs_bellman_ford_path(G)) >>> print(path[0][4]) [0, 1, 2, 3, 4]