Shimbel Algorithm (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))

Time Complexity

$O(n^{4})$

Space Complexity

$O(n^{2})$ words

(Derived: Uses a $V \times V$ matrix to store and calculate distances)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1953

Reference

https://link.springer.com/article/10.1007/BF02476438