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

From Algorithm Wiki

Revision as of 07:55, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{4})$

Space Complexity

$O(n^{2})$ words

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

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1953

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Shimbel_Algorithm_(APSP_on_Dense_Directed_Graphs_with_Arbitrary_Weights_All-Pairs_Shortest_Paths_(APSP))&oldid=46976"