Bellman-Ford Algorithm

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used for this purpose include Dijkstra's algorithm and reaching algorithm. The algorithm is implemented as BellmanFord[g, v] in the Wolfram Language package Combinatorica` .

See also

All-Pairs Shortest Path, Dijkstra's Algorithm, Floyd-Warshall Algorithm, Graph Distance, Graph Geodesic, Longest Path, Reaching Algorithm, Shortest Path, Shortest Path Problem

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Bellman-Ford Algorithm." From MathWorld--A Wolfram Web Resource.

Subject classifications