Kruskal's Algorithm

Kruskal's algorithm is a **greedy algorithm** used to discover the Minimum Spanning Tree (MST) of a connected, weighted graph. Instead of growing outward from a single point like Prim's, Kruskal's evaluates the entire system infrastructure simultaneously.

Core Operation Mechanics

1. **Sort Edges:** The algorithm starts by sorting every single link in the network by weight in non-decreasing order.
2. **Forest Integration:** It checks the lowest-weight path. If the endpoints are already part of the same connected component forest, the link is discarded to prevent a loop cycle.
3. **Union-Find:** If endpoints are isolated, it performs a Union merger to merge the components together.