1.1 --- a/test/graph_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/graph_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 @@ -66,7 +66,7 @@
    1.13  
    1.14    Edge e2 = G.addEdge(n2, n1),
    1.15         e3 = G.addEdge(n2, n3);
    1.16 -  ignore_unused_variable_warning(e2,e3);
    1.17 +  ::lemon::ignore_unused_variable_warning(e2,e3);
    1.18  
    1.19    checkGraphNodeList(G, 3);
    1.20    checkGraphEdgeList(G, 3);
    1.21 @@ -99,7 +99,7 @@
    1.22    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.23         e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
    1.24         e5 = G.addEdge(n4, n3);
    1.25 -  ignore_unused_variable_warning(e1,e3,e4,e5);
    1.26 +  ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);
    1.27  
    1.28    checkGraphNodeList(G, 4);
    1.29    checkGraphEdgeList(G, 5);
    1.30 @@ -179,7 +179,7 @@
    1.31    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.32         e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
    1.33         e5 = G.addEdge(n4, n3);
    1.34 -  ignore_unused_variable_warning(e1,e3,e4,e5);
    1.35 +  ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);
    1.36  
    1.37    // Check edge deletion
    1.38    G.erase(e2);
    1.39 @@ -220,7 +220,7 @@
    1.40    Node n1 = G.addNode(), n2 = G.addNode(), n3 = G.addNode();
    1.41    Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
    1.42         e3 = G.addEdge(n2, n3);
    1.43 -  ignore_unused_variable_warning(e1,e2,e3);
    1.44 +  ::lemon::ignore_unused_variable_warning(e1,e2,e3);
    1.45  
    1.46    checkGraphNodeList(G, 3);
    1.47    checkGraphEdgeList(G, 3);
    1.48 @@ -385,7 +385,7 @@
    1.49    Edge
    1.50      e1 = g.addEdge(n1, n2),
    1.51      e2 = g.addEdge(n2, n3);
    1.52 -  ignore_unused_variable_warning(e2);
    1.53 +  ::lemon::ignore_unused_variable_warning(e2);
    1.54  
    1.55    check(g.valid(n1), "Wrong validity check");
    1.56    check(g.valid(e1), "Wrong validity check");
    1.57 @@ -524,7 +524,7 @@
    1.58    checkGraphArcList(G, dim * (1 << dim));
    1.59  
    1.60    Node n = G.nodeFromId(dim);
    1.61 -  ignore_unused_variable_warning(n);
    1.62 +  ::lemon::ignore_unused_variable_warning(n);
    1.63  
    1.64    for (NodeIt n(G); n != INVALID; ++n) {
    1.65      checkGraphIncEdgeList(G, n, dim);