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. 
a form teacher that is bad a maths and bad at teaching. and always wants to see kids looking their worst and stares them down
by Jandolassscuzhefass January 31, 2022
Get the korey fordemug. It's a sedan without trunk cover. Often mistaken as midsize truck but in reality they sit right next to 95 Corolla , only slightly higher. Usually used by college graduates who think they look cool to live the redneck lifestyle.
by The Rightwrong November 21, 2019
Get the Ford Ranger T6mug.