Work

Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time