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:
“The putting into force of laws which shall secure the conservation of our resources, as far as they may be within the jurisdiction of the Federal Government, including the more important work of saving and restoring our forests and the great improvement of waterways, are all proper government functions which must involve large expenditure if properly performed.”
—William Howard Taft (1857–1930)