Tsinghua researchers break 41-year record, prove Dijkstra is not optimal
jedisct1 · x · 2026-09-01
A Tsinghua University team published a paper breaking the "sorting barrier" held since 1984: textbooks taught that shortest-path search requires sorting nodes by distance, which has a mathematical floor. By combining Bellman-Ford logic with a novel "recursive partial ordering" method, they solve the problem without fully sorting nodes, proving Dijkstra—used everywhere from Google Maps to internet routing—is not optimal.
More from Research
- Opus-assisted open design: a $31k low-field head MRI sketched in hours — DreamFly_13 · 2026-10-18
- semiconductor.diy: open-source guides to make real chips in a garden shed — jwt0625 · 2026-10-18
- Work in progress: geometric structure of GPG projections as Markov chain coarsening — michaelchchoi · 2026-10-18
- Backprop-free pretraining gets 2.3x speedup as Noise method crushes Dust record on 8 GPUs — inductionheads · 2026-10-18
- q3dviewer: open-source Qt+OpenGL tool for painter-like point cloud editing — 4310sy · 2026-10-18
- Smarter Every Day's Destin to defend PhD dissertation on impact fusion — CatAstro_Piyush · 2026-10-18