3.7.26. Balanced tree
A constraint that allows for expressing the fact that we want to cover a digraph by one (or more) balanced tree. A balanced tree is a tree where no leaf is much farther away than a given threshold from the root than any other leaf. The distance between a leaf and the root of a tree is the number of vertices on the path from the root to the leaf.