diff -r 8e3a00d4678e -r 5e273e0bd5e2 lemon/bipartite_matching.h
--- a/lemon/bipartite_matching.h	Tue Jan 23 13:13:39 2007 +0000
+++ b/lemon/bipartite_matching.h	Thu Jan 25 14:36:21 2007 +0000
@@ -164,7 +164,7 @@
     /// \brief An augmenting phase of the Hopcroft-Karp algorithm
     ///
     /// It runs an augmenting phase of the Hopcroft-Karp
-    /// algorithm. The phase finds maximum count of edge disjoint
+    /// algorithm. This phase finds maximum count of edge disjoint
     /// augmenting paths and augments on these paths. The algorithm
     /// consists at most of \f$ O(\sqrt{n}) \f$ phase and one phase is
     /// \f$ O(e) \f$ long.
@@ -258,7 +258,7 @@
     /// \brief An augmenting phase of the Ford-Fulkerson algorithm
     ///
     /// It runs an augmenting phase of the Ford-Fulkerson
-    /// algorithm. The phase finds only one augmenting path and 
+    /// algorithm. This phase finds only one augmenting path and 
     /// augments only on this paths. The algorithm consists at most 
     /// of \f$ O(n) \f$ simple phase and one phase is at most 
     /// \f$ O(e) \f$ long.
@@ -734,7 +734,7 @@
     /// \brief An augmenting phase of the weighted matching algorithm
     ///
     /// It runs an augmenting phase of the weighted matching 
-    /// algorithm. The phase finds the best augmenting path and 
+    /// algorithm. This phase finds the best augmenting path and 
     /// augments only on this paths. 
     ///
     /// The algorithm consists at most