1.1 --- a/test/bellman_ford_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/bellman_ford_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 @@ -65,8 +65,10 @@
    1.13    Node s, t, n;
    1.14    Arc e;
    1.15    Value l;
    1.16 +  ::lemon::ignore_unused_variable_warning(l);
    1.17    int k=3;
    1.18    bool b;
    1.19 +  ::lemon::ignore_unused_variable_warning(b);
    1.20    BF::DistMap d(gr);
    1.21    BF::PredMap p(gr);
    1.22    LengthMap length;
    1.23 @@ -147,6 +149,8 @@
    1.24  
    1.25    Digraph g;
    1.26    bool b;
    1.27 +  ::lemon::ignore_unused_variable_warning(b);
    1.28 +
    1.29    bellmanFord(g,LengthMap()).run(Node());
    1.30    b = bellmanFord(g,LengthMap()).run(Node(),Node());
    1.31    bellmanFord(g,LengthMap())
    1.32 @@ -190,7 +194,7 @@
    1.33    check(pathTarget(gr, p) == t, "path() found a wrong path.");
    1.34  
    1.35    ListPath<Digraph> path;
    1.36 -  Value dist;
    1.37 +  Value dist = 0;
    1.38    bool reached = bellmanFord(gr,length).path(path).dist(dist).run(s,t);
    1.39  
    1.40    check(reached && dist == -1, "Bellman-Ford found a wrong path.");