1.1 --- a/lemon/bfs.h	Mon Jan 22 12:13:57 2007 +0000
     1.2 +++ b/lemon/bfs.h	Tue Jan 23 12:51:39 2007 +0000
     1.3 @@ -520,7 +520,7 @@
     1.4      ///reached parameter will be set true. The reached parameter
     1.5      ///should be initially false.
     1.6      ///
     1.7 -    ///\param target The nodemaps of possible targets.
     1.8 +    ///\param nm The nodemaps of possible targets.
     1.9      ///\retval reached Indicates that one of the target nodes is reached.
    1.10      ///\return The processed node.
    1.11      ///
    1.12 @@ -617,7 +617,7 @@
    1.13      ///
    1.14      ///\param nm must be a bool (or convertible) node map. The
    1.15      ///algorithm will stop when it reached a node \c v with
    1.16 -    ///<tt>nm[v]</tt> true.
    1.17 +    /// <tt>nm[v]</tt> true.
    1.18      ///\todo query the reached target
    1.19      template<class NM>
    1.20      void start(const NM &nm)
    1.21 @@ -1435,7 +1435,7 @@
    1.22      /// reached parameter will be set true. The reached parameter
    1.23      /// should be initially false.
    1.24      ///
    1.25 -    /// \param target The nodemaps of possible targets.
    1.26 +    /// \param nm The nodemaps of possible targets.
    1.27      /// \retval reached Indicates that one of the target nodes is reached.
    1.28      /// \return The processed node.
    1.29      ///
    1.30 @@ -1514,7 +1514,7 @@
    1.31      ///
    1.32      ///\param nm must be a bool (or convertible) node map. The
    1.33      ///algorithm will stop when it reached a node \c v with
    1.34 -    ///<tt>nm[v]</tt> true.
    1.35 +    /// <tt>nm[v]</tt> true.
    1.36      template <typename NM>
    1.37      void start(const NM &nm) {
    1.38        bool reached = false;