Skip to content
ı
Workspace
Visualizer
Search anything…
⌘ K
Desk
Path
Problems
Review
More
Library
/
Kruskal's Minimum Spanning Tree
graphs
Best
O(E log E)
Avg
O(E log E)
Worst
O(E log E)
Space
O(V)
Preparing Kruskal's Minimum Spanning Tree...
Greedily adds lowest-weight edges that do not form a cycle, using Disjoint-Set Union (Union-Find).