What is a minimum spanning forest? [closed]

StackOverflow https://stackoverflow.com/questions/14302628

Question

A minimum spanning tree gives the cheapest way an undirected graph. But what is a minimum spanning forest? Is it defined for connected graphs or unconnected graphs?

Was it helpful?

Solution

Minimum spanning forest is a generalization of minimum spanning tree for unconnected graphs. For every component of the graph, take its MST and the resulting collection is a minimum spanning forest.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top