A Deterministic Algorithm that Outpaces Dijkstra on Sparse Graphs In an arXiv preprint, Breaking the Sorting Barrier for Directed Single-Source Shortest Paths , authors Ran Duan, Longhui Yin et al, present the first deterministic algorithm that beats the classic O (... algorithms graph algorithms shortest paths theory