bellman_ford_path(G, source, target, weight='weight')¶
Returns the shortest path from source to target in a weighted graph G.
- G (NetworkX graph)
- source (node) – Starting node
- target (node) – Ending node
- weight (string, optional (default=’weight’)) – Edge data key corresponding to the edge weight
path – List of nodes in a shortest path.
sourceis not in
NetworkXNoPath– If no path exists between source and target.
>>> G=nx.path_graph(5) >>> print(nx.bellman_ford_path(G, 0, 4)) [0, 1, 2, 3, 4]
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.