diff -r 1e9cc7b2eabc -r 059dcdda37c5 lemon/bfs.h
--- a/lemon/bfs.h	Wed Sep 26 14:37:48 2007 +0000
+++ b/lemon/bfs.h	Thu Sep 27 13:04:06 2007 +0000
@@ -593,9 +593,8 @@
     ///with addSource() before using this function.
     ///
     ///This method runs the %BFS algorithm from the root node(s)
-    ///in order to
-    ///compute the
-    ///shortest path to \c dest. The algorithm computes
+    ///in order to compute the shortest path to \c dest.
+    ///The algorithm computes
     ///- The shortest path to \c  dest.
     ///- The distance of \c dest from the root(s).
     void start(Node dest)
@@ -615,7 +614,7 @@
     ///algorithm will stop when it reaches a node \c v with
     /// <tt>nm[v]</tt> true.
     ///
-    ///\return The reached node \c v with <tt>nm[v]<\tt> true or
+    ///\return The reached node \c v with <tt>nm[v]</tt> true or
     ///\c INVALID if no such node was found.
     template<class NM>
     Node start(const NM &nm)
@@ -1517,7 +1516,7 @@
     ///algorithm will stop when it reaches a node \c v with
     /// <tt>nm[v]</tt> true.
     ///
-    ///\return The reached node \c v with <tt>nm[v]<\tt> true or
+    ///\return The reached node \c v with <tt>nm[v]</tt> true or
     ///\c INVALID if no such node was found.
     template <typename NM>
     Node start(const NM &nm) {