algorithm - What is a minimum spanning forest?

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?

Answer 1

最小生成森林是对无连接图的最小生成树的推广。对于图的每个组件，取其 MST，得到的集合是最小生成森林。