networkx.algorithms.is_arborescence¶

networkx.algorithms.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.
Returns:	b : bool A boolean that is True if G is an arborescence.

See also

is_tree

Notes

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