Package org.chocosolver.solver.constraints.nary.tree

Class Summary

Class	Description
PropAntiArborescences	AntiArborescences propagation (simplification from tree constraint) based on dominators loops (i.e., variables such that x[i]=i) are considered as roots Can use the simple LT algorithm which runs in O(m.log(n)) worst case time Or a slightly more sophisticated one, linear in theory but not necessarily faster in practice