Dijkstra's algorithm with binary heap (Johnson 1977) (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((E + V) log V)$ == Space Complexity == $O(V)$ auxiliary words (keeping track of distances/previous node in path, along with heap) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1977 == Reference == https://dl.acm.org/citation.cfm?id=321993")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O((E + V) log V)$

Space Complexity

$O(V)$ auxiliary words

(keeping track of distances/previous node in path, along with heap)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1977

Reference

https://dl.acm.org/citation.cfm?id=321993

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dijkstra%27s_algorithm_with_binary_heap_(Johnson_1977)_(Nonnegative_Weights_Shortest_Path_(Directed_Graphs))&oldid=44614"