1 #include "problem.hpp"
2 #include "constraints/edgecolouredgraph.hpp"
3 #include "search/search.hpp"
4 #include <iostream>
5
main(void)6 int main(void)
7 {
8 Problem p(6);
9 vec1<vec1<UncolouredEdge> > s(6); // c++14 : {{2},{3},{1},{5},{6},{4}};
10 int vals[] = {0,2,3,1,5,6,4};
11 for(int i : range1(6))
12 s[i].push_back(vals[i]);
13 std::vector<AbstractConstraint*> v;
14 v.push_back(new EdgeColouredGraph<UncolouredEdge, GraphDirected_no>(s, GraphConfig(), &p.p_stack));
15 SearchOptions so;
16 so.only_find_generators = false;
17
18 SolutionStore ss = doSearch(&p, v, so);
19
20 D_ASSERT(ss.sols().size() ==(3*2)*(3*2)*2);
21 }
22