Programmers Community @Bangladesh | Chinese scientists have developed the best shortest-path algorithm in 41 years

A team from Tsinghua University has broken Dijkstra’s “sorting barrier” — the first improvement since 1984.

The new algorithm runs in O(m \log^{2/3} n) time. Potential applications? Faster shorter waits for route calculations, fewer traffic jams, cheaper deliveries, and more efficient computer networks.

And,a need to update computer science curricula:)

Paper - arxiv.org/pdf/2504.17033

[Copied]