Tag
This post discusses methods to conduct Dijkstra's algorithm directly on algebraic graph representations without converting to adjacency maps, leveraging graph compression techniques.
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.