Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs))

From Algorithm Wiki

Revision as of 10:37, 15 February 2023 by Admin (talk | contribs) (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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dijkstra%27s_algorithm_with_list_(Whiting_%26_Hillier_1960)_(Nonnegative_Weights_Shortest_Path_(Directed_Graphs))&oldid=44613"