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ˋ .

all-pairs shortest path | Dijkstra's algorithm | Floyd-Warshall algorithm | graph distance | graph geodesic | longest path | reaching algorithm | shortest path | shortest path problem