Kruskal's algorithm
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree.
Source: Wikipedia, Kruskal's algorithm. Text licensed CC BY-SA 4.0. Not endorsed by or affiliated with Wikipedia or the Wikimedia Foundation.