test/euler_test.cc
branch1.2
changeset 1244 af461bae0601
parent 956 141f9c0db4a3
parent 1157 761fe0846f49
child 1259 8b2d4e5d96e4
equal deleted inserted replaced
3:533853a53f60 7:7f47faf9372e
    99   }
    99   }
   100   {
   100   {
   101     Digraph d;
   101     Digraph d;
   102     Graph g(d);
   102     Graph g(d);
   103     Digraph::Node n = d.addNode();
   103     Digraph::Node n = d.addNode();
   104 
   104     ignore_unused_variable_warning(n);
       
   105   
   105     checkDiEulerIt(d);
   106     checkDiEulerIt(d);
   106     checkDiEulerIt(g);
   107     checkDiEulerIt(g);
   107     checkEulerIt(g);
   108     checkEulerIt(g);
   108 
   109 
   109     check(eulerian(d), "This graph is Eulerian");
   110     check(eulerian(d), "This graph is Eulerian");
   187     Digraph::Node n1 = d.addNode();
   188     Digraph::Node n1 = d.addNode();
   188     Digraph::Node n2 = d.addNode();
   189     Digraph::Node n2 = d.addNode();
   189     Digraph::Node n3 = d.addNode();
   190     Digraph::Node n3 = d.addNode();
   190     Digraph::Node n4 = d.addNode();
   191     Digraph::Node n4 = d.addNode();
   191     Digraph::Node n5 = d.addNode();
   192     Digraph::Node n5 = d.addNode();
       
   193     ignore_unused_variable_warning(n0,n4,n5);
   192 
   194 
   193     d.addArc(n1, n2);
   195     d.addArc(n1, n2);
   194     d.addArc(n2, n3);
   196     d.addArc(n2, n3);
   195     d.addArc(n3, n1);
   197     d.addArc(n3, n1);
   196 
   198