@AlSweigart ...or, when we talk about Dijkstra's algorithm, why not make it O(m log^(2/3) n)!? 😜
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths:
https://arxiv.org/abs/2504.17033
To achieve this, the researchers _combine_ Dijkstra’s algorithm with Bellman-Ford algorithm - incredible stuff! 🤓