# networkx.algorithms.tree.recognition.is_branching¶

is_branching(G)[source]

Returns True if G is a branching.

A branching is a directed forest with maximum in-degree equal to 1.

Parameters

G (directed graph) – The directed graph to test.

Returns

b – A boolean that is True if G is a branching.

Return type

bool

Notes

In another convention, a branching is also known as a forest.