Kruskal's Algorithm

Kruskal's Algorithm builds a Minimum Spanning Tree (MST) by sorting all edges and adding them in order of increasing weight, ensuring no cycles are formed. It is efficient for sparse graphs and uses a union-find data structure to manage connected components.