If true, constraints are generated for each edge in the largest (heuristic) directed acyclic subgraph such that the edge must point downwards.
Only valid when
hier, generates level constraints similar to those used with
mode=“hier”. The main difference is that, in the latter
case, only these constraints are involved, so a faster solver can be used.