Kruskal’s Algorithm

Let $T$ be the subgraph of $G$ with no edges, but the same vertices. While does not connect $G$, add the lightest edge $e$ that does not form a cycle with $T$. Then $T$ is the minimum spanning tree (MST).