Shimbel Algorithm (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(V^{4})$ == Space Complexity == $O(V^{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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n^{4})$ | ||
== Space Complexity == | == Space Complexity == | ||
$O( | $O(n^{2})$ words | ||
(Derived: Uses a $V \times V$ matrix to store and calculate distances) | (Derived: Uses a $V \times V$ matrix to store and calculate distances) | ||
Latest revision as of 07:55, 10 April 2023
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