Floyd–Warshall algorithm (APSP 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^{3})$

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

1962

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=368168

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Floyd–Warshall_algorithm_(APSP_All-Pairs_Shortest_Paths_(APSP))&oldid=46977"