标签
本文讨论了直接在代数图表示上运行Dijkstra算法的方法，无需转换为邻接图，并利用了图压缩技术。
Researchers from Tsinghua University have developed a new shortest-path algorithm with O(m log^{2/3} n) complexity, surpassing Dijkstra's algorithm which had been considered theoretically optimal for 41 years.