Kruskal's Algorithm
Kruskal's Algorithm is another way to find a Minimum Spanning Tree (MST) in a graph. It works by iteratively adding the cheapest available edge that connects two previously disconnected components, without forming a cycle. It is efficient for sparse graphs and uses a union-find data structure to detect cycles.
Things to Observe
- Component Merging: Observe how adding an edge merges two previously separate components into one. The visualization shows nodes moving together as components are unified, demonstrating how the algorithm gradually connects all vertices.
- Cycle Detection: Watch how union-find data structure efficiently checks if two vertices are not in the same connected component before adding an edge.
Union-Find
© 2025 SEE Algorithms. Code licensed under MIT, content under CC BY-NC 4.0.