This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Returns \(True\) if \(G\) is a tree.
A tree is a connected graph with no undirected cycles.
For directed graphs, \(G\) is a tree if the underlying graph is a tree. The underlying graph is obtained by treating each directed edge as a single undirected edge in a multigraph.
G : graph
The graph to test.
b : bool
A boolean that is \(True\) if \(G\) is a tree.
In another convention, a directed tree is known as a polytree and then tree corresponds to an arborescence.