1.1 --- a/test/connectivity_test.cc	Fri Aug 24 15:37:23 2012 +0200
     1.2 +++ b/test/connectivity_test.cc	Thu Sep 13 11:45:36 2012 +0200
     1.3 @@ -68,6 +68,7 @@
     1.4      Digraph::NodeMap<int> order(d);
     1.5      Graph g(d);
     1.6      Digraph::Node n = d.addNode();
     1.7 +    ignore_unused_variable_warning(n);
     1.8  
     1.9      check(stronglyConnected(d), "This digraph is strongly connected");
    1.10      check(countStronglyConnectedComponents(d) == 1,
    1.11 @@ -245,6 +246,7 @@
    1.12      Digraph::Node shoe = d.addNode();
    1.13      Digraph::Node watch = d.addNode();
    1.14      Digraph::Node pants = d.addNode();
    1.15 +    ignore_unused_variable_warning(watch);
    1.16  
    1.17      d.addArc(socks, shoe);
    1.18      d.addArc(pants, shoe);