Science
Floyd–Warshall algorithm
Bernard Roy
Algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
ByBernard Roy
Related
More to read
Bellman–Ford algorithmTextBorůvka's algorithmTextA* search algorithmText
Eulerian pathText
Las Vegas algorithmText
Kruskal's algorithmText
Ant colony optimization algorithmsTextBreadth-first searchText
Aho–Corasick algorithmText
Odd–even sortText
Polynomial long divisionText
Vehicle routing problemText
Taxicab geometryTextGraph theoryText
Langton's antTextLeast squares methodTextAround this
Beyond inventions
Fantastic VoyageGame🇵🇹
🇧🇬The Physics of SorrowBookHalf-Life: Opposing ForceGame🇺🇸Harms WayGame🇦🇹
🇨🇭The WarImage
🇮🇹VermouthFood
🇮🇱A Horse Walks into a BarBook
🇲🇦WhiteflyBookLeonardoGame🇨🇭Spacewar!Game🇺🇸The Almost GoneGame🇧🇪LocomotionGame🇨🇭Order of WarGame🇧🇾After the WarGame🇪🇸
🇸🇵The Biggest Ideas in the Universe: Space, Time, and MotionBookOriginal WarGame🇨🇿
🇧🇬The Physics of SorrowBookHalf-Life: Opposing ForceGame🇺🇸Harms WayGame🇦🇹🇨🇭The WarImage🇮🇹VermouthFood🇮🇱A Horse Walks into a BarBook🇲🇦WhiteflyBookLeonardoGame🇨🇭Spacewar!Game🇺🇸The Almost GoneGame🇧🇪LocomotionGame🇨🇭Order of WarGame🇧🇾After the WarGame🇪🇸🇸🇵The Biggest Ideas in the Universe: Space, Time, and MotionBookOriginal WarGame🇨🇿World tour
Same vibe, elsewhere
Euclidean LandsGame🇦🇹Waltz of the WizardGame🇮🇸Gallop & RideGame🇦🇹
🇱🇻Riga Black BalsamFoodFantasy WarsGame🇷🇺GateGame🇨🇭Weaving TidesGame🇦🇹
🇩🇪The City of Dreaming BooksBookThe HobbitGame🇦🇺Hyper ForceGame🇧🇪FAR: Lone SailsGame🇨🇭War Front: Turning PointGame🇭🇺HowlGame🇦🇹KontrabantGame🇸🇮The LongingGame🇩🇪MinesweeperGame🇵🇪
🇱🇻Riga Black BalsamFoodFantasy WarsGame🇷🇺GateGame🇨🇭Weaving TidesGame🇦🇹🇩🇪The City of Dreaming BooksBookThe HobbitGame🇦🇺Hyper ForceGame🇧🇪FAR: Lone SailsGame🇨🇭War Front: Turning PointGame🇭🇺HowlGame🇦🇹KontrabantGame🇸🇮The LongingGame🇩🇪MinesweeperGame🇵🇪