Kruskal's MST
Spanning TreeMediumConstruct a Minimum Spanning Tree by sorting edges and joining components with DSU.
Alt+Shift+K
Configuration Panel
Make sure edges have weights on the canvas above then run Kruskal to generate the spanning tree.
Complexity Mappings
Time ComplexityO(E log E) / O(E log V) sorting time
Space ComplexityO(V) DSU parent arrays
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
Kruskal's Algorithm finds the Minimum Spanning Tree (MST) by sorting all graph edges by weight and adding them one by one, avoiding cycle paths using a Disjoint Set Union (DSU).
Algorithm Mechanism
Initialize parent arrays. Sort edges ascending. Loop through edges: if endpoints have different roots, union components and add edge to tree; otherwise skip.
Source: CP-Algorithms reference guide