New fastest shortest-path algorithm in 41 years!
Tsinghua researchers broke Dijkstra’s 1984 “sorting barrier,” achieving O(m log^(2/3) n) time. This means faster route planning, less traffic, cheaper deliveries, and more efficient networks – and a CS curriculum revamp =) https://t.co/MMuK1x8jRH— Dorsa Rohani (@dorsa_rohani)
Aug 10, 2025
from http://twitter.com/dorsa_rohani
via IFTTT