Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:defines |
A spanning forest of a graph is a subgraph that is a forest and includes all the vertices of the graph.
|
| https://www.w3.org/2000/01/rdf-schema#label |
Spanning Forest
|
| gptkbp:property |
If the graph is connected, the spanning forest is a spanning tree.
A spanning forest contains no cycles. A spanning forest is a union of spanning trees for each connected component of the graph. |
| gptkbp:relatedTo |
graph
spanning tree |
| gptkbp:usedIn |
combinatorics
algorithm design network design |
| gptkbp:bfsParent |
gptkb:Spanning_Tree
|
| gptkbp:bfsLayer |
7
|