1.1 --- a/test/graph_test.cc	Fri Aug 24 15:37:23 2012 +0200
     1.2 +++ b/test/graph_test.cc	Thu Sep 13 11:45:36 2012 +0200
     1.3 @@ -63,6 +63,7 @@
     1.4  
     1.5    Edge e2 = G.addEdge(n2, n1),
     1.6         e3 = G.addEdge(n2, n3);
     1.7 +  ignore_unused_variable_warning(e2,e3);
     1.8  
     1.9    checkGraphNodeList(G, 3);
    1.10    checkGraphEdgeList(G, 3);
    1.11 @@ -95,6 +96,7 @@
    1.12    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.13         e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
    1.14         e5 = G.addEdge(n4, n3);
    1.15 +  ignore_unused_variable_warning(e1,e3,e4,e5);
    1.16  
    1.17    checkGraphNodeList(G, 4);
    1.18    checkGraphEdgeList(G, 5);
    1.19 @@ -174,6 +176,7 @@
    1.20    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.21         e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
    1.22         e5 = G.addEdge(n4, n3);
    1.23 +  ignore_unused_variable_warning(e1,e3,e4,e5);
    1.24  
    1.25    // Check edge deletion
    1.26    G.erase(e2);
    1.27 @@ -214,6 +217,7 @@
    1.28    Node n1 = G.addNode(), n2 = G.addNode(), n3 = G.addNode();
    1.29    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.30         e3 = G.addEdge(n2, n3);
    1.31 +  ignore_unused_variable_warning(e1,e2,e3);
    1.32  
    1.33    checkGraphNodeList(G, 3);
    1.34    checkGraphEdgeList(G, 3);
    1.35 @@ -362,6 +366,7 @@
    1.36    Edge
    1.37      e1 = g.addEdge(n1, n2),
    1.38      e2 = g.addEdge(n2, n3);
    1.39 +  ignore_unused_variable_warning(e2);
    1.40  
    1.41    check(g.valid(n1), "Wrong validity check");
    1.42    check(g.valid(e1), "Wrong validity check");
    1.43 @@ -491,6 +496,7 @@
    1.44    checkGraphArcList(G, dim * (1 << dim));
    1.45  
    1.46    Node n = G.nodeFromId(dim);
    1.47 +  ignore_unused_variable_warning(n);
    1.48  
    1.49    for (NodeIt n(G); n != INVALID; ++n) {
    1.50      checkGraphIncEdgeList(G, n, dim);