1.1 --- a/lemon/bellman_ford.h	Sun Oct 04 10:15:32 2009 +0200
     1.2 +++ b/lemon/bellman_ford.h	Wed Dec 09 11:14:06 2009 +0100
     1.3 @@ -23,6 +23,7 @@
     1.4  /// \file
     1.5  /// \brief Bellman-Ford algorithm.
     1.6  
     1.7 +#include <lemon/list_graph.h>
     1.8  #include <lemon/bits/path_dump.h>
     1.9  #include <lemon/core.h>
    1.10  #include <lemon/error.h>
    1.11 @@ -299,7 +300,7 @@
    1.12      ///
    1.13      /// \ref named-templ-param "Named parameter" for setting
    1.14      /// \c OperationTraits type.
    1.15 -    /// For more information see \ref BellmanFordDefaultOperationTraits.
    1.16 +    /// For more information, see \ref BellmanFordDefaultOperationTraits.
    1.17      template <class T>
    1.18      struct SetOperationTraits
    1.19        : public BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits<T> > {
    1.20 @@ -717,7 +718,7 @@
    1.21      /// is not reached from the root(s) or if \c v is a root.
    1.22      ///
    1.23      /// The shortest path tree used here is equal to the shortest path
    1.24 -    /// tree used in \ref predNode() and \predMap().
    1.25 +    /// tree used in \ref predNode() and \ref predMap().
    1.26      ///
    1.27      /// \pre Either \ref run() or \ref init() must be called before
    1.28      /// using this function.
    1.29 @@ -732,7 +733,7 @@
    1.30      /// is not reached from the root(s) or if \c v is a root.
    1.31      ///
    1.32      /// The shortest path tree used here is equal to the shortest path
    1.33 -    /// tree used in \ref predArc() and \predMap().
    1.34 +    /// tree used in \ref predArc() and \ref predMap().
    1.35      ///
    1.36      /// \pre Either \ref run() or \ref init() must be called before
    1.37      /// using this function.
    1.38 @@ -775,7 +776,7 @@
    1.39      /// This function gives back a directed cycle with negative total
    1.40      /// length if the algorithm has already found one.
    1.41      /// Otherwise it gives back an empty path.
    1.42 -    lemon::Path<Digraph> negativeCycle() {
    1.43 +    lemon::Path<Digraph> negativeCycle() const {
    1.44        typename Digraph::template NodeMap<int> state(*_gr, -1);
    1.45        lemon::Path<Digraph> cycle;
    1.46        for (int i = 0; i < int(_process.size()); ++i) {