1.1 --- a/test/connectivity_test.cc	Wed Nov 28 11:58:00 2012 +0100
     1.2 +++ b/test/connectivity_test.cc	Wed Aug 07 06:55:05 2013 +0200
     1.3 @@ -68,7 +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 +    ::lemon::ignore_unused_variable_warning(n);
     1.9  
    1.10      check(stronglyConnected(d), "This digraph is strongly connected");
    1.11      check(countStronglyConnectedComponents(d) == 1,
    1.12 @@ -246,7 +246,7 @@
    1.13      Digraph::Node shoe = d.addNode();
    1.14      Digraph::Node watch = d.addNode();
    1.15      Digraph::Node pants = d.addNode();
    1.16 -    ignore_unused_variable_warning(watch);
    1.17 +    ::lemon::ignore_unused_variable_warning(watch);
    1.18  
    1.19      d.addArc(socks, shoe);
    1.20      d.addArc(pants, shoe);