Kruskal's algorithm

Kruskal's algorithm is a method used to find the minimum spanning tree (MST) of a connected, undirected graph. A minimum spanning tree is a subset of the edges in the graph that connects all the vertices together without any cycles and with the minimum possible total edge weight.