1.1 --- a/test/digraph_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/digraph_test.cc	Wed Oct 17 19:14:07 2018 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -64,7 +64,7 @@
    1.13    Arc a2 = G.addArc(n2, n1),
    1.14        a3 = G.addArc(n2, n3),
    1.15        a4 = G.addArc(n2, n3);
    1.16 -  ignore_unused_variable_warning(a2,a3,a4);
    1.17 +  ::lemon::ignore_unused_variable_warning(a2,a3,a4);
    1.18  
    1.19    checkGraphNodeList(G, 3);
    1.20    checkGraphArcList(G, 4);
    1.21 @@ -93,7 +93,7 @@
    1.22    Node n1 = G.addNode(), n2 = G.addNode(), n3 = G.addNode();
    1.23    Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n2, n1),
    1.24        a3 = G.addArc(n2, n3), a4 = G.addArc(n2, n3);
    1.25 -  ignore_unused_variable_warning(a1,a2,a3,a4);
    1.26 +  ::lemon::ignore_unused_variable_warning(a1,a2,a3,a4);
    1.27  
    1.28    Node n4 = G.split(n2);
    1.29  
    1.30 @@ -127,7 +127,7 @@
    1.31    Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n4, n1),
    1.32        a3 = G.addArc(n4, n3), a4 = G.addArc(n4, n3),
    1.33        a5 = G.addArc(n2, n4);
    1.34 -  ignore_unused_variable_warning(a1,a2,a3,a5);
    1.35 +  ::lemon::ignore_unused_variable_warning(a1,a2,a3,a5);
    1.36  
    1.37    checkGraphNodeList(G, 4);
    1.38    checkGraphArcList(G, 5);
    1.39 @@ -207,7 +207,7 @@
    1.40    Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n4, n1),
    1.41        a3 = G.addArc(n4, n3), a4 = G.addArc(n3, n1),
    1.42        a5 = G.addArc(n2, n4);
    1.43 -  ignore_unused_variable_warning(a2,a3,a4,a5);
    1.44 +  ::lemon::ignore_unused_variable_warning(a2,a3,a4,a5);
    1.45  
    1.46    // Check arc deletion
    1.47    G.erase(a1);
    1.48 @@ -255,7 +255,7 @@
    1.49    Node n1 = G.addNode(), n2 = G.addNode(), n3 = G.addNode();
    1.50    Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n2, n1),
    1.51        a3 = G.addArc(n2, n3), a4 = G.addArc(n2, n3);
    1.52 -  ignore_unused_variable_warning(a1,a2,a3,a4);
    1.53 +  ::lemon::ignore_unused_variable_warning(a1,a2,a3,a4);
    1.54  
    1.55    typename Digraph::Snapshot snapshot(G);
    1.56  
    1.57 @@ -356,7 +356,7 @@
    1.58    Arc
    1.59      e1 = g.addArc(n1, n2),
    1.60      e2 = g.addArc(n2, n3);
    1.61 -  ignore_unused_variable_warning(e2);
    1.62 +  ::lemon::ignore_unused_variable_warning(e2);
    1.63  
    1.64    check(g.valid(n1), "Wrong validity check");
    1.65    check(g.valid(e1), "Wrong validity check");
    1.66 @@ -442,6 +442,7 @@
    1.67      a2 = g.addArc(n2, n1),
    1.68      a3 = g.addArc(n2, n3),
    1.69      a4 = g.addArc(n2, n3);
    1.70 +  ::lemon::ignore_unused_variable_warning(a2,a3,a4);
    1.71  
    1.72    digraphCopy(g, G).nodeRef(nref).run();
    1.73