Faster Than Dijkstra: The New Shortest-Path Algorithm, Explained
A new shortest path algorithm finally beats Dijkstra on sparse graphs. How it breaks the 65-year sorting barrier, and why Dijkstra still wins in practice.
Algorithms
Four Color Theorem: 2026 Proof Breaks a 30-Year Record
The four color theorem is 174 years old. In 2026, six mathematicians found a way to 4-color any planar graph far faster, breaking a 30-year speed record.