1 #include "problem.hpp"
2 #include "constraints/edgecolouredgraph.hpp"
3 #include <iostream>
4 
main(void)5 int main(void)
6 {
7     Problem p(10);
8     vec1<vec1<UncolouredEdge> > s(10);
9     int vals[][4] = {{0},{2,3,0},{1,3,0},{1,2,8,0},{5,0},{6,0},{7,0},{8,0},{9,0},{2,10,0}, {2,5,0}};
10     for(int i : range1(s.size()))
11     {
12         for(int j = 0; vals[i][j] != 0; ++j)
13             s[i].push_back(vals[i][j]);
14     }
15     p.addConstraint(new EdgeColouredGraph<UncolouredEdge, GraphDirected_yes>(s, GraphConfig(), &p.p_stack));
16     p.p_stack.sanity_check();
17     p.con_store.initConstraints(true);
18     p.p_stack.sanity_check();
19     assert(p.p_stack.cellCount() == 10);
20     p.con_queue.invokeQueue();
21     p.p_stack.sanity_check();
22     assert(p.p_stack.cellCount() == 10);
23 }
24