Some doc fix
authordeba
Tue, 21 Nov 2006 18:29:31 +0000
changeset 2307558cc308a4bd
parent 2306 42cce226b87b
child 2308 cddae1c4fee6
Some doc fix
lemon/bfs.h
     1.1 --- a/lemon/bfs.h	Tue Nov 21 18:22:08 2006 +0000
     1.2 +++ b/lemon/bfs.h	Tue Nov 21 18:29:31 2006 +0000
     1.3 @@ -587,9 +587,9 @@
     1.4        while ( !emptyQueue() ) processNextNode();
     1.5      }
     1.6      
     1.7 -    ///Executes the algorithm until \c dest is the next node to processed.
     1.8 +    ///Executes the algorithm until \c dest is reached.
     1.9  
    1.10 -    ///Executes the algorithm until \c dest is the next node to processed.
    1.11 +    ///Executes the algorithm until \c dest is reached.
    1.12      ///
    1.13      ///\pre init() must be called and at least one node should be added
    1.14      ///with addSource() before using this function.
    1.15 @@ -615,7 +615,7 @@
    1.16      ///with addSource() before using this function.
    1.17      ///
    1.18      ///\param nm must be a bool (or convertible) node map. The
    1.19 -    ///algorithm will stop when for the next processable node \c v is
    1.20 +    ///algorithm will stop when it reached a node \c v with
    1.21      ///<tt>nm[v]</tt> true.
    1.22      ///\todo query the reached target
    1.23      template<class NM>
    1.24 @@ -1502,9 +1502,9 @@
    1.25        while ( !emptyQueue() ) processNextNode();
    1.26      }
    1.27      
    1.28 -    /// \brief Executes the algorithm until \c dest will be next processed.
    1.29 +    /// \brief Executes the algorithm until \c dest is reached.
    1.30      ///
    1.31 -    /// Executes the algorithm until \c dest will be next processed.
    1.32 +    /// Executes the algorithm until \c dest is reached.
    1.33      ///
    1.34      /// \pre init() must be called and at least one node should be added
    1.35      /// with addSource() before using this function.
    1.36 @@ -1523,7 +1523,7 @@
    1.37      /// with addSource() before using this function.
    1.38      ///
    1.39      ///\param nm must be a bool (or convertible) node map. The
    1.40 -    ///algorithm will stop when it reaches a node \c v with
    1.41 +    ///algorithm will stop when it reached a node \c v with
    1.42      ///<tt>nm[v]</tt> true.
    1.43      template <typename NM>
    1.44      void start(const NM &nm) {