Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs)): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O( V² )$ == Space Complexity == $O(V)$ auxiliary words (keeping track of distances/previous node in path, along with list) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1960 == Reference == https://www.jstor.org/stable/3007178?seq=1#page_scan_tab_contents") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(V^{2})$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(V)$ | $O(V)$ words | ||
(keeping track of distances/previous node in path, along with list) | (keeping track of distances/previous node in path, along with list) | ||
Latest revision as of 08:55, 10 April 2023
Time Complexity
$O(V^{2})$
Space Complexity
$O(V)$ words
(keeping track of distances/previous node in path, along with list)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1960
Reference
https://www.jstor.org/stable/3007178?seq=1#page_scan_tab_contents