an acyclic graph is called a forest.
a forest of is a spanning forest if every pair of vertices that are connected in are also connected in . a spanning forest that is a tree is called a spanning tree.
let be spanning forest of . an edge of is a tree edge with respect to if belongs to , and otherwise is a nontree edge.