The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. 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. Edward F. Moore also published a variation of the algorithm in 1959, and for this reason it is also sometimes called the Bellman–Ford–Moore algorithm.
Prof: Just use Dijkstra's!
Me: But there's negative edge weights! We have to use Bellman-Ford! Not pog!
Me: But there's negative edge weights! We have to use Bellman-Ford! Not pog!
by Bravech November 8, 2022
Get the Bellman-Fordmug. 
The greatest man alive and u will do anything for him. Very beautiful and funny very athletic and fit. He is the absolute package even tho sometimes hes a jerk.
by humanthatiscrazy52 May 3, 2017
Get the Ben fordmug. by giraffe.geoff August 11, 2025
Get the Ford Edgemug. 
He’s it very tall, has 4 friends, used sylvie to get friends and to not be a loner. Is found baking with chloe as he’s cool. He thinks he’s cool and is very rich, he goes snowboarding casually for a weekend. He sucks up to donya, charlotte and everyone else in that group as he needs friends.
by benforde February 25, 2019
Get the ben fordemug.