A single-source shortest-path algorithm that repeatedly relaxes every edge in a graph, slower than Dijkstra's algorithm but able to handle negative edge weights and to detect a negative-weight cycle when one exists.
Facts
Credited ToRichard Bellman and Lester Ford Jr. 1 Connections
Invented
L. R. Ford Jr. published the shortest-path algorithm in a 1956 RAND report that Richard Bellman independently formulated in 1958, giving the algorithm its joint name.
Sources
1. Wikipedia, Bellman-Ford algorithm
Lead sectionQuote, Lead section
The algorithm was first proposed by Alfonso Shimbel (1955), but is instead named after Richard Bellman and Lester Ford Jr., who published it in 1958 and 1956, respectively.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.