Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs))

From Algorithm Wiki

Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(E log log L)$ == Space Complexity == $O(V+L)$ words (https://www.sciencedirect.com/science/article/pii/0166218X8390104X?via%3Dihub) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1981 == Reference == https://www.sciencedirect.com/science/article/pii/0166218X8390104X?via%3Dihub")

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

Jump to navigation Jump to search

Time Complexity

$O(E log log L)$

Space Complexity

$O(V+L)$ words

(https://www.sciencedirect.com/science/article/pii/0166218X8390104X?via%3Dihub)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1981

Reference

https://www.sciencedirect.com/science/article/pii/0166218X8390104X?via%3Dihub

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dijkstra%27s_algorithm_with_Fibonacci_heap_(Johnson_1981;_Karlsson_%26_Poblete_1983)_(Nonnegative_Integer_Weights_Shortest_Path_(Directed_Graphs))&oldid=44616"