1.1 --- a/lemon/bipartite_matching.h	Tue Jan 23 13:13:39 2007 +0000
     1.2 +++ b/lemon/bipartite_matching.h	Thu Jan 25 14:36:21 2007 +0000
     1.3 @@ -164,7 +164,7 @@
     1.4      /// \brief An augmenting phase of the Hopcroft-Karp algorithm
     1.5      ///
     1.6      /// It runs an augmenting phase of the Hopcroft-Karp
     1.7 -    /// algorithm. The phase finds maximum count of edge disjoint
     1.8 +    /// algorithm. This phase finds maximum count of edge disjoint
     1.9      /// augmenting paths and augments on these paths. The algorithm
    1.10      /// consists at most of \f$ O(\sqrt{n}) \f$ phase and one phase is
    1.11      /// \f$ O(e) \f$ long.
    1.12 @@ -258,7 +258,7 @@
    1.13      /// \brief An augmenting phase of the Ford-Fulkerson algorithm
    1.14      ///
    1.15      /// It runs an augmenting phase of the Ford-Fulkerson
    1.16 -    /// algorithm. The phase finds only one augmenting path and 
    1.17 +    /// algorithm. This phase finds only one augmenting path and 
    1.18      /// augments only on this paths. The algorithm consists at most 
    1.19      /// of \f$ O(n) \f$ simple phase and one phase is at most 
    1.20      /// \f$ O(e) \f$ long.
    1.21 @@ -734,7 +734,7 @@
    1.22      /// \brief An augmenting phase of the weighted matching algorithm
    1.23      ///
    1.24      /// It runs an augmenting phase of the weighted matching 
    1.25 -    /// algorithm. The phase finds the best augmenting path and 
    1.26 +    /// algorithm. This phase finds the best augmenting path and 
    1.27      /// augments only on this paths. 
    1.28      ///
    1.29      /// The algorithm consists at most