1.1 --- a/lemon/planarity.h	Thu Sep 13 11:56:19 2012 +0200
     1.2 +++ b/lemon/planarity.h	Thu Sep 13 12:02:27 2012 +0200
     1.3 @@ -72,7 +72,6 @@
     1.4        }
     1.5  
     1.6        void discover(const Arc& arc) {
     1.7 -        Node source = _graph.source(arc);
     1.8          Node target = _graph.target(arc);
     1.9  
    1.10          _tree_map[arc] = true;

     2.1 --- a/test/bellman_ford_test.cc	Thu Sep 13 11:56:19 2012 +0200
     2.2 +++ b/test/bellman_ford_test.cc	Thu Sep 13 12:02:27 2012 +0200
     2.3 @@ -190,7 +190,7 @@
     2.4    check(pathTarget(gr, p) == t, "path() found a wrong path.");
     2.5  
     2.6    ListPath<Digraph> path;
     2.7 -  Value dist;
     2.8 +  Value dist = 0;
     2.9    bool reached = bellmanFord(gr,length).path(path).dist(dist).run(s,t);
    2.10  
    2.11    check(reached && dist == -1, "Bellman-Ford found a wrong path.");

     3.1 --- a/test/digraph_test.cc	Thu Sep 13 11:56:19 2012 +0200
     3.2 +++ b/test/digraph_test.cc	Thu Sep 13 12:02:27 2012 +0200
     3.3 @@ -442,6 +442,7 @@
     3.4      a2 = g.addArc(n2, n1),
     3.5      a3 = g.addArc(n2, n3),
     3.6      a4 = g.addArc(n2, n3);
     3.7 +  ignore_unused_variable_warning(a2,a3,a4);
     3.8  
     3.9    digraphCopy(g, G).nodeRef(nref).run();
    3.10  

     4.1 --- a/test/fractional_matching_test.cc	Thu Sep 13 11:56:19 2012 +0200
     4.2 +++ b/test/fractional_matching_test.cc	Thu Sep 13 12:02:27 2012 +0200
     4.3 @@ -342,6 +342,7 @@
     4.4        check(indeg == 1, "Invalid matching");
     4.5        pv += weight[mwfm.matching(n)];
     4.6        SmartGraph::Node o = graph.target(mwfm.matching(n));
     4.7 +      ignore_unused_variable_warning(o);
     4.8      } else {
     4.9        check(mwfm.nodeValue(n) == 0, "Invalid matching");
    4.10        check(indeg == 0, "Invalid matching");
    4.11 @@ -406,6 +407,7 @@
    4.12      check(indeg == 1, "Invalid perfect matching");
    4.13      pv += weight[mwpfm.matching(n)];
    4.14      SmartGraph::Node o = graph.target(mwpfm.matching(n));
    4.15 +    ignore_unused_variable_warning(o);
    4.16    }
    4.17  
    4.18    for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {