Kruskal’s Algorithm

A greedy algorithm used in graph theory to find the minimum spanning tree (MST) for a weighted, undirected graph. It iteratively adds edges with the smallest weights to the MST, provided they don't create a cycle. Uses the Disjoint Set Union data structure to efficiently detect cycles.