Bellman-Ford Algorithm

Richard Bellman & Lester Ford Jr., 1958

Developed independently by Richard Bellman (1958) and Lester Ford Jr. (1956), this algorithm finds shortest paths by relaxing every edge in the graph across V-1 passes. Unlike Dijkstra's algorithm, it correctly handles graphs with negative edge weights. The visualization sweeps through all edges each pass, highlighting the currently relaxed edge in gold. A pass counter tracks progress. After completion, the shortest path from A to H traces in coral.