Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs))
Jump to navigation
Jump to search
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
1984
Reference
https://www.cs.princeton.edu/courses/archive/fall03/cs528/handouts/fibonacci%20heaps.pdf