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

From Algorithm Wiki
Jump to navigation Jump to search
(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")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(E log log L)$
$O(E \log \log L)$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 08:55, 10 April 2023

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=46973"