Minimum spanning forest
= Minimum spanning forest
A <forest> containing one <minimum spanning tree> of each <connected component of a graph> of a finite undirected <weighted graph>, including isolated <vertices>. For disconnected input, <Kruskal's algorithm> returns a <minimum spanning forest>.