An all pairs shortest path algorithm with expected running time O(n 2logn)
Alistair Moffat, Tadao Takaoka · 1985
An algorithm is described that solves the all pairs shortest path problem for a nonnegatively weighted graph. The algorithm has an average requirement on quite general classes of random graphs of O(n2logn) time, where n is the number of vertices in the graph.