# HG changeset patch
# User deba
# Date 1164133771 0
# Node ID 558cc308a4bd6b2a0c7cbdb201f31163759fb6d3
# Parent  42cce226b87b4460ef4293a84c311fef67072817
Some doc fix

diff -r 42cce226b87b -r 558cc308a4bd lemon/bfs.h
--- a/lemon/bfs.h	Tue Nov 21 18:22:08 2006 +0000
+++ b/lemon/bfs.h	Tue Nov 21 18:29:31 2006 +0000
@@ -587,9 +587,9 @@
       while ( !emptyQueue() ) processNextNode();
     }
     
-    ///Executes the algorithm until \c dest is the next node to processed.
+    ///Executes the algorithm until \c dest is reached.
 
-    ///Executes the algorithm until \c dest is the next node to processed.
+    ///Executes the algorithm until \c dest is reached.
     ///
     ///\pre init() must be called and at least one node should be added
     ///with addSource() before using this function.
@@ -615,7 +615,7 @@
     ///with addSource() before using this function.
     ///
     ///\param nm must be a bool (or convertible) node map. The
-    ///algorithm will stop when for the next processable node \c v is
+    ///algorithm will stop when it reached a node \c v with
     ///<tt>nm[v]</tt> true.
     ///\todo query the reached target
     template<class NM>
@@ -1502,9 +1502,9 @@
       while ( !emptyQueue() ) processNextNode();
     }
     
-    /// \brief Executes the algorithm until \c dest will be next processed.
+    /// \brief Executes the algorithm until \c dest is reached.
     ///
-    /// Executes the algorithm until \c dest will be next processed.
+    /// Executes the algorithm until \c dest is reached.
     ///
     /// \pre init() must be called and at least one node should be added
     /// with addSource() before using this function.
@@ -1523,7 +1523,7 @@
     /// with addSource() before using this function.
     ///
     ///\param nm must be a bool (or convertible) node map. The
-    ///algorithm will stop when it reaches a node \c v with
+    ///algorithm will stop when it reached a node \c v with
     ///<tt>nm[v]</tt> true.
     template <typename NM>
     void start(const NM &nm) {