CSCI2100 · Definition · Chapter 14 · Graph algorithms
Spanning forest
0 steps of prerequisites below it
A spanning forest of a finite undirected multigraph contains every vertex, has no cycle and has the same connected components as the graph.
Taught in
Builds on
Nothing in the notes sits below this point: it is a starting point.
Used by
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Nothing is recorded below this point: it is a starting point.