diff -r 0977046c60d2 -r 6f10c6ec5a21 lemon/bellman_ford.h
--- a/lemon/bellman_ford.h	Sat Sep 26 07:21:54 2009 +0200
+++ b/lemon/bellman_ford.h	Mon Sep 28 15:53:20 2009 +0200
@@ -23,6 +23,7 @@
 /// \file
 /// \brief Bellman-Ford algorithm.
 
+#include <lemon/list_graph.h>
 #include <lemon/bits/path_dump.h>
 #include <lemon/core.h>
 #include <lemon/error.h>
@@ -775,7 +776,7 @@
     /// This function gives back a directed cycle with negative total
     /// length if the algorithm has already found one.
     /// Otherwise it gives back an empty path.
-    lemon::Path<Digraph> negativeCycle() {
+    lemon::Path<Digraph> negativeCycle() const {
       typename Digraph::template NodeMap<int> state(*_gr, -1);
       lemon::Path<Digraph> cycle;
       for (int i = 0; i < int(_process.size()); ++i) {