Every component grabs its cheapest edge out, all at once, and the pieces merge. A minimum spanning tree in at most log V rounds.
This interactive visualization needs JavaScript.