1.1 --- a/lemon/bellman_ford.h Wed Sep 26 14:37:48 2007 +0000
1.2 +++ b/lemon/bellman_ford.h Thu Sep 27 13:04:06 2007 +0000
1.3 @@ -432,7 +432,7 @@
1.4 /// \warning The paths with limited edge number cannot be retrieved
1.5 /// easily with \ref path() or \ref predEdge() functions. If you
1.6 /// need the shortest path and not just the distance you should store
1.7 - /// after each iteration the \ref predEdgeMap() map and manually build
1.8 + /// after each iteration the \ref predMap() map and manually build
1.9 /// the path.
1.10 ///
1.11 /// \return %True when the algorithm have not found more shorter
1.12 @@ -545,7 +545,7 @@
1.13 /// \warning The paths with limited edge number cannot be retrieved
1.14 /// easily with \ref path() or \ref predEdge() functions. If you
1.15 /// need the shortest path and not just the distance you should store
1.16 - /// after each iteration the \ref predEdgeMap() map and manually build
1.17 + /// after each iteration the \ref predMap() map and manually build
1.18 /// the path.
1.19 ///
1.20 /// The algorithm computes
1.21 @@ -951,7 +951,7 @@
1.22 /// \brief Runs BellmanFord algorithm from the given node.
1.23 ///
1.24 /// Runs BellmanFord algorithm from the given node.
1.25 - /// \param source is the given source.
1.26 + /// \param src is the given source.
1.27 void run(Node src) {
1.28 Base::_source = src;
1.29 run();
1.30 @@ -1016,7 +1016,7 @@
1.31 /// \brief Sets the source node, from which the BellmanFord algorithm runs.
1.32 ///
1.33 /// Sets the source node, from which the BellmanFord algorithm runs.
1.34 - /// \param source is the source node.
1.35 + /// \param src is the source node.
1.36 BellmanFordWizard<_Traits>& source(Node src) {
1.37 Base::_source = src;
1.38 return *this;