复杂度小于Dijkstra 最短路径算法

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

Breaking the Sorting Barrier: Why a New Shortest‑Path Algorithm Matters (Even If You Still Love Dijkstra)