Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs))

From Algorithm Wiki

Revision as of 08:55, 10 April 2023 by Admin (talk | contribs)

(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)$ 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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dijkstra%27s_algorithm_with_Fibonacci_heap_(Fredman_%26_Tarjan_1984;_Fredman_%26_Tarjan_1987)_(Nonnegative_Weights_Shortest_Path_(Directed_Graphs))&oldid=46972"