Index: lemon/planarity.h
===================================================================
--- lemon/planarity.h	(revision 877)
+++ lemon/planarity.h	(revision 999)
@@ -73,5 +73,4 @@
 
       void discover(const Arc& arc) {
-        Node source = _graph.source(arc);
         Node target = _graph.target(arc);
 
Index: test/bellman_ford_test.cc
===================================================================
--- test/bellman_ford_test.cc	(revision 880)
+++ test/bellman_ford_test.cc	(revision 999)
@@ -191,5 +191,5 @@
 
   ListPath<Digraph> path;
-  Value dist;
+  Value dist = 0;
   bool reached = bellmanFord(gr,length).path(path).dist(dist).run(s,t);
 
Index: test/digraph_test.cc
===================================================================
--- test/digraph_test.cc	(revision 998)
+++ test/digraph_test.cc	(revision 999)
@@ -443,4 +443,5 @@
     a3 = g.addArc(n2, n3),
     a4 = g.addArc(n2, n3);
+  ignore_unused_variable_warning(a2,a3,a4);
 
   digraphCopy(g, G).nodeRef(nref).run();
Index: test/fractional_matching_test.cc
===================================================================
--- test/fractional_matching_test.cc	(revision 877)
+++ test/fractional_matching_test.cc	(revision 999)
@@ -343,4 +343,5 @@
       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");
@@ -407,4 +408,5 @@
     pv += weight[mwpfm.matching(n)];
     SmartGraph::Node o = graph.target(mwpfm.matching(n));
+    ignore_unused_variable_warning(o);
   }