Examples of solver.constraints.nary.tree.PropAntiArborescences

solver.constraints.nary.tree.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 @author Jean-Guillaume Fages

     *                (which counts from 1 to n instead of from 0 to n-1)
     * @return a tree constraint
     */
    public static Constraint tree(IntVar[] SUCCS, IntVar NBTREES, int OFFSET) {
        return new Constraint("tree",
                new PropAntiArborescences(SUCCS, OFFSET, false),
                new PropKLoops(SUCCS, OFFSET, NBTREES)
        );
    }

View Full Code Here

TOP

Related Classes of solver.constraints.nary.tree.PropAntiArborescences

solver.constraints.IntConstraintFactory

util.graphOperations.dominance.AlphaDominatorsFinder

util.graphOperations.dominance.SimpleDominatorsFinder

util.objects.graphs.DirectedGraph

util.objects.setDataStructures.ISet

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.