Quick Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

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/citation.cfm?id=2791187

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Quick_Kruskal_algorithm_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=46921"