Answers are grounded in this paper and cite their sources.
We present a new algorithm for finding the shortest path between each pair of nodes in a directed nonnegatively weighted graph. Our algorithm has average running time O(n² log ² n) where the graph has n nodes in contrast to previous algorithms in the literature, all of whose average running times are O(n³ ) for this problem.
No takes yet. Share an insight, caveat, or question.
Philip M. Spira (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: