Graph Terminology (cont)
A spanning tree of connected graph G = (V,E)
- is a subgraph of G containing all of V
- and is a single tree (connected, no cycles)
A spanning forest of non-connected graph G = (V,E)
- is a subgraph of G containing all of V
- and is a set of trees (not connected, no cycles),
- with one tree for each connected component
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}