1.1 --- a/test/dfs_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/dfs_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 @@ -67,6 +67,8 @@
    1.13    Arc e;
    1.14    int l, i;
    1.15    bool b;
    1.16 +  ::lemon::ignore_unused_variable_warning(l,i,b);
    1.17 +
    1.18    DType::DistMap d(G);
    1.19    DType::PredMap p(G);
    1.20    Path<Digraph> pp;
    1.21 @@ -151,6 +153,8 @@
    1.22  
    1.23    Digraph g;
    1.24    bool b;
    1.25 +  ::lemon::ignore_unused_variable_warning(b);
    1.26 +
    1.27    dfs(g).run(Node());
    1.28    b=dfs(g).run(Node(),Node());
    1.29    dfs(g).run();
    1.30 @@ -219,7 +223,7 @@
    1.31    Dfs<Digraph> dfs(G);
    1.32    check(dfs.run(s1,t1) && dfs.reached(t1),"Node 3 is reachable from Node 6.");
    1.33    }
    1.34 -  
    1.35 +
    1.36    {
    1.37      NullMap<Node,Arc> myPredMap;
    1.38      dfs(G).predMap(myPredMap).run(s);