Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs)): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O((E + V) log V)$ | $O((E + V) \log V)$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(V)$ | $O(V)$ words | ||
(keeping track of distances/previous node in path, along with heap) | (keeping track of distances/previous node in path, along with heap) | ||
Latest revision as of 07:55, 10 April 2023
Time Complexity
$O((E + V) \log V)$
Space Complexity
$O(V)$ 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