Examples of solver.constraints.nary.PropSort

solver.constraints.nary.PropSort
SortingConstraint is a constraint that ensures that a vector is the sorted version of a second one. The filtering algorithm is the version of Kurt Mehlhorn and Sven Thiel, from CP'00 (Faster algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint). @author Sylvain Bouveret (initial code) @author Charles Prud'homme (migration to choco3, debugging) @since 17 apr. 2014

     * @param VARS       an array of variables
     * @param SORTEDVARS an array of variables sorted in increasing order
     * @return a sort constraint
     */
    public static Constraint sort(IntVar[] VARS, IntVar[] SORTEDVARS) {
        return new Constraint("Sort", new PropSort(VARS, SORTEDVARS));
    }

View Full Code Here

TOP

Related Classes of solver.constraints.nary.PropSort

gnu.trove.stack.array.TIntArrayStack

solver.constraints.IntConstraintFactory

util.objects.PriorityQueue

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.