collection of disjoint trees: acyclic graph structures explained

set trees disjoint acyclic graphs tree structures connected graph theory forest components spanning rooted binary node connections traversal leaf nodes parent-child depth edge relations hierarchy structure subsets collection non-cyclic undirected algorithms minimal tree partition sets connectivity height hierarchy decomposition multi-tree analysis representation disconnected clustering isomorphism edges forest theory concepts