Science
Bellman–Ford algorithm
L. R. Ford, Jr., Richard E. Bellman, Edward F. Moore
Algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
ByL. R. Ford, Jr., Richard E. Bellman, Edward F. Moore

Related
More to read
Floyd–Warshall algorithmTextBorůvka's algorithmTextA* search algorithmText
Eulerian pathText
Kruskal's algorithmText
Ant colony optimization algorithmsTextBreadth-first searchText
Las Vegas algorithmText
Aho–Corasick algorithmTextLeast squares methodText
Odd–even sortTextAround this
Beyond inventions
The PathGame🇧🇪
🇩🇪a path with trees on the sideImage
🇫🇷man walking beside gray vehicle\ImageMini MotorwaysGame🇳🇿
🇫🇷a person walking down a narrow city streetImageMotor CityGame🇦🇹The Almost GoneGame🇧🇪
🇧🇳Almayer's FollyBook
🇪🇪a cobblestone street with cars parked on both sidesImageThe HobbitGame🇦🇺
🇦🇹A blurry photo of a man riding a skateboard across a streetImage
🇹🇹Angostura bittersFood
🇮🇹pathway between beige housesImage
🇸🇪BeartownBook
🇪🇪an orange car parked on the side of the roadImage
🇧🇪Chapel RoadBook
🇧🇳Almayer's FollyBook
🇹🇹Angostura bittersFood
🇸🇪BeartownBook
🇧🇪Chapel RoadBookWorld tour
Same vibe, elsewhere
The LongingGame🇩🇪BallanceGame🇩🇪KontrabantGame🇸🇮
🇹🇷a man walking down a street next to tall buildingsImage
🇮🇹VermouthFood
🇮🇱A Horse Walks into a BarBookGateGame🇨🇭
🇪🇪a narrow cobblestone street in a european cityImage
🇺🇸a street with cars and trees by a body of waterImage
🇩🇪A man riding a skateboard across a cement parking lotImage
🇪🇪people walking on road between buildingsImage
🇺🇸Crossing the streetImage
🇦🇹a city street with a traffic light and a street signImageThe Short GreyGame🇨🇭
🇬🇧Biking on an early Sunday morning through London, I spotted an empty Regent Street except for one very typical "Borismaster" bus.Image
🇦🇹a street with cars and a bus on itImage
🇮🇹VermouthFood
🇮🇱A Horse Walks into a BarBookGateGame🇨🇭