1.1 --- a/test/bpgraph_test.cc	Sun Aug 11 22:01:06 2013 +0200
     1.2 +++ b/test/bpgraph_test.cc	Sun Aug 11 22:30:44 2013 +0200
     1.3 @@ -78,6 +78,7 @@
     1.4    Edge
     1.5      e2 = G.addEdge(bn1, rn1),
     1.6      e3 = G.addEdge(rn1, bn2);
     1.7 +  ::lemon::ignore_unused_variable_warning(e2,e3);
     1.8  
     1.9    checkGraphNodeList(G, 3);
    1.10    checkGraphRedNodeList(G, 1);
    1.11 @@ -119,6 +120,7 @@
    1.12    Edge
    1.13      e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3),
    1.14      e3 = G.addEdge(n4, n2), e4 = G.addEdge(n4, n3);
    1.15 +  ::lemon::ignore_unused_variable_warning(e1,e3,e4);
    1.16  
    1.17    // Check edge deletion
    1.18    G.erase(e2);
    1.19 @@ -167,6 +169,7 @@
    1.20    Edge
    1.21      e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3),
    1.22      e3 = G.addEdge(n4, n2), e4 = G.addEdge(n4, n3);
    1.23 +  ::lemon::ignore_unused_variable_warning(e1,e3,e4);
    1.24  
    1.25    G.changeRed(e2, n4);
    1.26    check(G.redNode(e2) == n4, "Wrong red node");
    1.27 @@ -219,6 +222,7 @@
    1.28    Edge
    1.29      e1 = G.addEdge(n1, n2),
    1.30      e2 = G.addEdge(n1, n3);
    1.31 +  ::lemon::ignore_unused_variable_warning(e1,e2);
    1.32  
    1.33    checkGraphNodeList(G, 3);
    1.34    checkGraphRedNodeList(G, 1);
    1.35 @@ -304,6 +308,7 @@
    1.36    Edge
    1.37      e1 = g.addEdge(n1, n2),
    1.38      e2 = g.addEdge(n1, n3);
    1.39 +  ::lemon::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");