Spanning Forests
A spanning forest is a type of subgraph that generalises the concept of a spanning tree. However, there are two definitions in common use. One is that a spanning forest is a subgraph that consists of a spanning tree in each connected component of a graph. (Equivalently, it is a maximal cycle-free subgraph.) This definition is common in computer science and optimization. It is also the definition used when discussing minimum spanning forests, the generalization to disconnected graphs of minimum spanning trees. Another definition, common in graph theory, is that a spanning forest is any subgraph that is both a forest (contains no cycles) and spanning (includes every vertex).
Read more about this topic: Spanning Tree
Famous quotes containing the word forests:
“Ye say they all have passed away,
That noble race and brave;
That their light canoes have vanished
From off the crested wave;
That, mid the forests where they roamed,
There rings no hunters’ shout;
But their name is on your waters,
Ye may not wash it out.”
—Lydia Huntley Sigourney (1791–1865)