# networkx.algorithms.tree.recognition.is_arborescence¶

is_arborescence(G)[source]

Returns True if G is an arborescence.

An arborescence is a directed tree with maximum in-degree equal to 1.

Parameters: G (graph) – The graph to test. b – A boolean that is True if G is an arborescence. bool

Notes

In another convention, an arborescence is known as a tree.