diff -r 1e9cc7b2eabc -r 059dcdda37c5 lemon/bellman_ford.h
--- a/lemon/bellman_ford.h	Wed Sep 26 14:37:48 2007 +0000
+++ b/lemon/bellman_ford.h	Thu Sep 27 13:04:06 2007 +0000
@@ -432,7 +432,7 @@
     /// \warning The paths with limited edge number cannot be retrieved
     /// easily with \ref path() or \ref predEdge() functions. If you
     /// need the shortest path and not just the distance you should store
-    /// after each iteration the \ref predEdgeMap() map and manually build
+    /// after each iteration the \ref predMap() map and manually build
     /// the path.
     ///
     /// \return %True when the algorithm have not found more shorter
@@ -545,7 +545,7 @@
     /// \warning The paths with limited edge number cannot be retrieved
     /// easily with \ref path() or \ref predEdge() functions. If you
     /// need the shortest path and not just the distance you should store
-    /// after each iteration the \ref predEdgeMap() map and manually build
+    /// after each iteration the \ref predMap() map and manually build
     /// the path.
     ///
     /// The algorithm computes
@@ -951,7 +951,7 @@
     /// \brief Runs BellmanFord algorithm from the given node.
     ///
     /// Runs BellmanFord algorithm from the given node.
-    /// \param source is the given source.
+    /// \param src is the given source.
     void run(Node src) {
       Base::_source = src;
       run();
@@ -1016,7 +1016,7 @@
     /// \brief Sets the source node, from which the BellmanFord algorithm runs.
     ///
     /// Sets the source node, from which the BellmanFord algorithm runs.
-    /// \param source is the source node.
+    /// \param src is the source node.
     BellmanFordWizard<_Traits>& source(Node src) {
       Base::_source = src;
       return *this;