b = isForest G
b = isForest H
This function determines if a graph or hypergraph is a forest. A graph is a forest if if the graph has no cycles. We say that a hypergraph is forest if each connected component is a tree in the sense of S. Faridi. See the paper "The facet ideal of a simplicial complex," Manuscripta Mathematica 109, 159-174 (2002).
|
|
|
|
|
The object isForest is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/EdgeIdeals.m2:3353:0.