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},{},{},{}};
10 s[2].push_back(2);
11 s[3].push_back(3);
12 std::vector<AbstractConstraint*> v;
13 v.push_back(new EdgeColouredGraph<UncolouredEdge, GraphDirected_yes>(s, GraphConfig(), &p.p_stack));
14 SearchOptions so;
15 so.only_find_generators = false;
16 SolutionStore ss = doSearch(&p, v, so);
17
18 D_ASSERT(ss.sols().size() ==4*3*2*2);
19 }
20