Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki
Revision as of 10:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(E + VlogV)$ == Space Complexity == $O(V)$ auxiliary? words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://dl.acm.org/citation.cfm?id=28874")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(E + VlogV)$

Space Complexity

$O(V)$ auxiliary? words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

https://dl.acm.org/citation.cfm?id=28874

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Prim%27s_algorithm_%2B_Fibonacci_heaps;_Fredman_%26_Tarjan_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=44595"