Balanced digraph — сбалансированный орграф.
1. A digraph is balanced, if for every vertex , .
2. A directed graph is called balanced if each of its cycles
contains equal numbers of forward and backward arcs.
3. A directed graph is balanced if there exists a homomorphism of to a monotone path.