Examples of findAllSolutions()

Examples of solver.Solver.findAllSolutions()

100
101
102
103
104
105
106
107
108
109
110
    @Test(groups = "1s")
    public void testBacktrack() {
        Solver s = modelit();
        long bl = 50;
        SearchMonitorFactory.limitBacktrack(s, bl);
        s.findAllSolutions();
        long bc = s.getMeasures().getBackTrackCount();
        Assert.assertEquals(bc, bl);
    }

    @Test(groups = "1s")
View Full Code Here

Examples of solver.Solver.findAllSolutions()

110
111
112
113
114
115
116
117
118
119
120
    @Test(groups = "1s")
    public void testFail() {
        Solver s = modelit();
        long fl = 50;
        SearchMonitorFactory.limitFail(s, fl);
        s.findAllSolutions();
        long fc = s.getMeasures().getFailCount();
        Assert.assertEquals(fc, fl);
    }

    @Test(groups = "1s")
View Full Code Here

Examples of solver.Solver.findAllSolutions()

120
121
122
123
124
125
126
127
128
129
130
    @Test(groups = "1s")
    public void testSolution() {
        Solver s = modelit();
        long sl = 50;
        SearchMonitorFactory.limitSolution(s, sl);
        s.findAllSolutions();
        long sc = s.getMeasures().getSolutionCount();
        Assert.assertEquals(sc, sl);
    }

    @Test(groups = "1s")
View Full Code Here

Examples of solver.Solver.findAllSolutions()

52
53
54
55
56
57
58
59
60
61
62
        solver.post(ICF.arithm(bvars[2], "=", bvars[3]));
        solver.post(ICF.arithm(bvars[2], "!=", bvars[3]));
        solver.set(ISF.lexico_LB(bvars));
        ExplanationFactory.CBJ.plugin(solver, true);
        SMF.log(solver, true, true);
        solver.findAllSolutions();
    }

    @Test
    public void pigeon() {
        Solver solver = new Solver();
View Full Code Here

Examples of solver.Solver.findAllSolutions()

67
68
69
70
71
72
73
74
            }
        }
        solver.set(ISF.lexico_LB(pigeon));
        ExplanationFactory.CBJ.plugin(solver, true);
        SMF.log(solver, true, true);
        solver.findAllSolutions();
    }
}
View Full Code Here

Examples of solver.Solver.findAllSolutions()

94
95
96
97
98
99
100
101
102
103
104
                st.setLength(0);
                st.append("-- " + j + " ------------------------------------------------------------------------------------\n");
                for (int i = 0; i < nbIt; i++) {
                    Solver rand = modeler(n);
                    PropagationEngineFactory.values()[j].make(rand);
                    rand.findAllSolutions();
                    st.append(StringUtils.pad(String.format("%.3f ", rand.getMeasures().getInitialPropagationTimeCount()), -7, " "));
                    times[i] = rand.getMeasures().getInitialPropagationTimeCount();
                    st.append(StringUtils.pad(String.format("%d ", rand.getMeasures().getNodeCount()), -7, " "));
                    st.append(StringUtils.pad(String.format("%d ", rand.getMeasures().getBackTrackCount()), -7, " "));
                    log.info(st.toString());
View Full Code Here

Examples of solver.Solver.findAllSolutions()

47
48
49
50
51
52
53
54
55
56
57
    public void testattmostnminusone() {
        Solver solver = new Solver();
        BoolVar[] BVARS = VF.boolArray("BS", 4, solver);
        SatFactory.addAtMostNMinusOne(BVARS);
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }

    @Test(groups = "1s")
    public void testattmostone() {
        Solver solver = new Solver();
View Full Code Here

Examples of solver.Solver.findAllSolutions()

56
57
58
59
60
61
62
63
64
65
66
    public void testattmostone() {
        Solver solver = new Solver();
        BoolVar[] BVARS = VF.boolArray("BS", 4, solver);
        SatFactory.addAtMostOne(BVARS);
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }

    @Test(groups = "1s")
    public void testboolandarrayequalfalse() {
        Solver solver = new Solver();
View Full Code Here

Examples of solver.Solver.findAllSolutions()

56
57
58
59
60
61
62
63
64
65
66
        int[] sols = {1, 1, 7, 24, 296, 1443};
        int[] nodes = {3, 22, 189, 1739, 17889, 189944};

        for (int i = 0; i < size.length; i++) {
            Solver sol = modeler(size[i]);
            sol.findAllSolutions();
            Assert.assertEquals(sol.getMeasures().getSolutionCount(), sols[i]);
//            Assert.assertEquals(sol.getMeasures().getNodeCount(), nodes[i]);
        }
    }
View Full Code Here

Examples of solver.Solver.findAllSolutions()

65
66
67
68
69
70
71
72
73
74
75
    public void testboolandarrayequalfalse() {
        Solver solver = new Solver();
        BoolVar[] BVARS = VF.boolArray("BS", 4, solver);
        SatFactory.addBoolAndArrayEqualFalse(BVARS);
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }

    @Test(groups = "1s")
    public void testboolorarrayequaltrue() {
        Solver solver = new Solver();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.