Skip to main content
Dictionary
Store
Blog
World
Help
Advertise
Chat
System Status
Information Collection Notice
Trademark Concerns
reCAPTCHA Privacy
Terms of Service
reCAPTCHA Terms
Privacy Policy
Accessibility
Report a Bug
Data Request
Contact Us
Security
DMCA
© 1999–2026 Urban Dictionary ®
Mugs
Tees
Hoodies
Pro Customization
Create unique products with your own words and definitions
Preview
Personalize Your Design
Your Word
Your Definition
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.
Text fits
Save
Cancel