Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP))
Revision as of 10:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3})$ == 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 == 1962 == Reference == https://dl.acm.org/citation.cfm?id=368168")
Time Complexity
$O(V^{3})$
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
1962