Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(E + | $O(E + V \log V)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:54, 10 April 2023
Time Complexity
$O(E + V \log V)$
Space Complexity
$O(V)$ auxiliary? words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1987