Changeset 999:00f8d9f9920d in lemon-main

Timestamp:

09/13/12 12:02:27 (12 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

1000:404b98971e1f, 1008:d216e1c8b3fa

Phase:

public

Message:

Further clang compilation fixes (#449)

Files:

• lemon/planarity.h (modified) (1 diff)
• test/bellman_ford_test.cc (modified) (1 diff)
• test/digraph_test.cc (modified) (1 diff)
• test/fractional_matching_test.cc (modified) (2 diffs)

lemon/planarity.h

@@ -73 +73 @@
 
       void discover(const Arc& arc) {
-        Node source = _graph.source(arc);
         Node target = _graph.target(arc);
 

test/bellman_ford_test.cc

@@ -191 +191 @@
 
   ListPath<Digraph> path;
-  Value dist;
+  Value dist = 0;
   bool reached = bellmanFord(gr,length).path(path).dist(dist).run(s,t);
 

test/digraph_test.cc

@@ -443 +443 @@
     a3 = g.addArc(n2, n3),
     a4 = g.addArc(n2, n3);
+  ignore_unused_variable_warning(a2,a3,a4);
 
   digraphCopy(g, G).nodeRef(nref).run();

test/fractional_matching_test.cc

@@ -343 +343 @@
       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 +408 @@
     pv += weight[mwpfm.matching(n)];
     SmartGraph::Node o = graph.target(mwpfm.matching(n));
+    ignore_unused_variable_warning(o);
   }