# HG changeset patch
# User Alpar Juttner <alpar@cs.elte.hu>
# Date 1347530547 -7200
# Node ID 00f8d9f9920dc88cb0b570a6bb2a7fcfeebee715
# Parent  7fdaa05a69a1ac7c563277403ae25a829d487e23
Further clang compilation fixes (#449)

diff -r 7fdaa05a69a1 -r 00f8d9f9920d lemon/planarity.h
--- a/lemon/planarity.h	Thu Sep 13 11:56:19 2012 +0200
+++ b/lemon/planarity.h	Thu Sep 13 12:02:27 2012 +0200
@@ -72,7 +72,6 @@
       }
 
       void discover(const Arc& arc) {
-        Node source = _graph.source(arc);
         Node target = _graph.target(arc);
 
         _tree_map[arc] = true;
diff -r 7fdaa05a69a1 -r 00f8d9f9920d test/bellman_ford_test.cc
--- a/test/bellman_ford_test.cc	Thu Sep 13 11:56:19 2012 +0200
+++ b/test/bellman_ford_test.cc	Thu Sep 13 12:02:27 2012 +0200
@@ -190,7 +190,7 @@
   check(pathTarget(gr, p) == t, "path() found a wrong path.");
 
   ListPath<Digraph> path;
-  Value dist;
+  Value dist = 0;
   bool reached = bellmanFord(gr,length).path(path).dist(dist).run(s,t);
 
   check(reached && dist == -1, "Bellman-Ford found a wrong path.");
diff -r 7fdaa05a69a1 -r 00f8d9f9920d test/digraph_test.cc
--- a/test/digraph_test.cc	Thu Sep 13 11:56:19 2012 +0200
+++ b/test/digraph_test.cc	Thu Sep 13 12:02:27 2012 +0200
@@ -442,6 +442,7 @@
     a2 = g.addArc(n2, n1),
     a3 = g.addArc(n2, n3),
     a4 = g.addArc(n2, n3);
+  ignore_unused_variable_warning(a2,a3,a4);
 
   digraphCopy(g, G).nodeRef(nref).run();
 
diff -r 7fdaa05a69a1 -r 00f8d9f9920d test/fractional_matching_test.cc
--- a/test/fractional_matching_test.cc	Thu Sep 13 11:56:19 2012 +0200
+++ b/test/fractional_matching_test.cc	Thu Sep 13 12:02:27 2012 +0200
@@ -342,6 +342,7 @@
       check(indeg == 1, "Invalid matching");
       pv += weight[mwfm.matching(n)];
       SmartGraph::Node o = graph.target(mwfm.matching(n));
+      ignore_unused_variable_warning(o);
     } else {
       check(mwfm.nodeValue(n) == 0, "Invalid matching");
       check(indeg == 0, "Invalid matching");
@@ -406,6 +407,7 @@
     check(indeg == 1, "Invalid perfect matching");
     pv += weight[mwpfm.matching(n)];
     SmartGraph::Node o = graph.target(mwpfm.matching(n));
+    ignore_unused_variable_warning(o);
   }
 
   for (SmartGraph::EdgeIt e(graph); e != INVALID; ++e) {