1.1 --- a/lemon/bfs.h	Thu Nov 05 15:50:01 2009 +0100
     1.2 +++ b/lemon/bfs.h	Sun Nov 15 19:57:02 2009 +0100
     1.3 @@ -701,12 +701,8 @@
     1.4  
     1.5      ///Runs the algorithm to visit all nodes in the digraph.
     1.6  
     1.7 -    ///This method runs the %BFS algorithm in order to
     1.8 -    ///compute the shortest path to each node.
     1.9 -    ///
    1.10 -    ///The algorithm computes
    1.11 -    ///- the shortest path tree (forest),
    1.12 -    ///- the distance of each node from the root(s).
    1.13 +    ///This method runs the %BFS algorithm in order to visit all nodes
    1.14 +    ///in the digraph.
    1.15      ///
    1.16      ///\note <tt>b.run(s)</tt> is just a shortcut of the following code.
    1.17      ///\code
    1.18 @@ -1046,8 +1042,8 @@
    1.19  
    1.20      ///Runs BFS algorithm to visit all nodes in the digraph.
    1.21  
    1.22 -    ///This method runs BFS algorithm in order to compute
    1.23 -    ///the shortest path to each node.
    1.24 +    ///This method runs BFS algorithm in order to visit all nodes
    1.25 +    ///in the digraph.
    1.26      void run()
    1.27      {
    1.28        run(INVALID);
    1.29 @@ -1695,12 +1691,8 @@
    1.30  
    1.31      /// \brief Runs the algorithm to visit all nodes in the digraph.
    1.32      ///
    1.33 -    /// This method runs the %BFS algorithm in order to
    1.34 -    /// compute the shortest path to each node.
    1.35 -    ///
    1.36 -    /// The algorithm computes
    1.37 -    /// - the shortest path tree (forest),
    1.38 -    /// - the distance of each node from the root(s).
    1.39 +    /// This method runs the %BFS algorithm in order to visit all nodes
    1.40 +    /// in the digraph.
    1.41      ///
    1.42      /// \note <tt>b.run(s)</tt> is just a shortcut of the following code.
    1.43      ///\code