Spanning forest
= Spanning forest
An acyclic spanning subgraph containing a <spanning tree> of each <connected component> of the original graph. For a graph with $n$ vertices and $c$ components, a spanning forest has $n-c$ edges.
= Spanning forest
An acyclic spanning subgraph containing a <spanning tree> of each <connected component> of the original graph. For a graph with $n$ vertices and $c$ components, a spanning forest has $n-c$ edges.