There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition model. This is the first result to break the O(m + n log n) time bound of Dijkstra’s algorithm on sparse graphs, showing that Dijkstra’s algorithm is ...

Read more

---

Link :
https://www.nextbigfuture.com/2025/08/new-sorting-algorithm-breakthrough-is-better-than-dijkstra.html