A New Algorithm Makes It Faster to Find the Shortest Paths A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

A new way to find the best routes - faster, smarter, elegant. It reminds me that simplicity often hides deep beauty in mathematics.
#ShortestPaths #Dijkstra #Algorithms #Math #Innovation #ComputerScience

#BellmanFord, a #DynamicProgramming #Algorithm, finds #ShortestPaths in graphs with negative arcs. It starts with infinite distances (except start), then iteratively refines them V-1 times. #GraphTheory

#SeymourConjecture: #Dijkstra's finds #ShortestPaths, crucial for general graph analysis. However, SSNC requires analyzing all paths of length 1 & 2, not just the shortest. Negative arcs/back arcs also complicate this.

I just completed "Race Condition" - Day 20 - Advent of Code 2024 #AdventOfCode adventofcode.com/2024/day/20
#shortestpaths #manhattandistance
It all cleared up when I thought about Manhattan distance... part 2 and part 1 are then almost the same.
github.com/jbudynek/adv...