Changes in / [782:ceb2756dea2a:780:580af8cf2f6a] in lemon-main

Files:

• lemon/bellman_ford.h (modified) (2 diffs)
• test/bellman_ford_test.cc (modified) (2 diffs)

lemon/bellman_ford.h

@@ -24 +24 @@
 /// \brief Bellman-Ford algorithm.
 
-#include <lemon/list_graph.h>
 #include <lemon/bits/path_dump.h>
 #include <lemon/core.h>
@@ -777 +776 @@
     /// length if the algorithm has already found one.
     /// Otherwise it gives back an empty path.
-    lemon::Path<Digraph> negativeCycle() const {
+    lemon::Path<Digraph> negativeCycle() {
       typename Digraph::template NodeMap<int> state(*_gr, -1);
       lemon::Path<Digraph> cycle;

test/bellman_ford_test.cc

@@ -97 +97 @@
     p  = const_bf_test.predMap();
     pp = const_bf_test.path(t);
-    pp = const_bf_test.negativeCycle();
     
     for (BF::ActiveIt it(const_bf_test); it != INVALID; ++it) {}
@@ -134 +133 @@
     b  = bf_test.reached(t);
     pp = bf_test.path(t);
-    pp = bf_test.negativeCycle();
   }
 }