forked from cp-algorithms/cp-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest_2sat.cpp
50 lines (44 loc) · 1.82 KB
/
test_2sat.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <cassert>
#include <vector>
using namespace std;
#include "2sat.h"
void test_2sat_example_usage() {
TwoSatSolver::example_usage();
}
void test_2sat_article_example() {
TwoSatSolver solver(3); // a, b, c
solver.add_disjunction(0, false, 1, true); // a v not b
solver.add_disjunction(0, true, 1, false); // not a v b
solver.add_disjunction(0, true, 1, true); // not a v not b
solver.add_disjunction(0, false, 2, true); // a v not c
assert(solver.solve_2SAT() == true);
auto expected = vector<bool>{{false, false, false}};
assert(solver.assignment == expected);
}
void test_2sat_unsatisfiable() {
TwoSatSolver solver(2); // a, b
solver.add_disjunction(0, false, 1, false); // a v b
solver.add_disjunction(0, false, 1, true); // a v not b
solver.add_disjunction(0, true, 1, false); // not a v b
solver.add_disjunction(0, true, 1, true); // not a v not b
assert(solver.solve_2SAT() == false);
}
void test_2sat_other_satisfiable_example() {
TwoSatSolver solver(4); // a, b, c, d
solver.add_disjunction(0, false, 1, true); // a v not b
solver.add_disjunction(0, true, 2, true); // not a v not c
solver.add_disjunction(0, false, 1, false); // a v b
solver.add_disjunction(3, false, 2, true); // d v not c
solver.add_disjunction(3, false, 0, true); // d v not a
assert(solver.solve_2SAT() == true);
// two solutions
auto expected_1 = vector<bool>{{true, true, false, true}};
auto expected_2 = vector<bool>{{true, false, false, true}};
assert(solver.assignment == expected_1 || solver.assignment == expected_2);
}
int main() {
test_2sat_example_usage();
test_2sat_article_example();
test_2sat_unsatisfiable();
test_2sat_other_satisfiable_example();
}