Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs))
Jump to navigation
Jump to search
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