Quick Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST))
Jump to navigation
Jump to search
Time Complexity
$O(E \log V)$
Space Complexity
$O(E)$ words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2006
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=2791187