[Lemon-commits] alpar: r3148 - hugo/trunk/lemon

[Lemon SVN]

Author: alpar
Date: Thu Jan 25 15:36:21 2007
New Revision: 3148

Modified:
   hugo/trunk/lemon/bipartite_matching.h
   hugo/trunk/lemon/elevator.h

Log:
Doc improvements

Modified: hugo/trunk/lemon/bipartite_matching.h
==============================================================================
--- hugo/trunk/lemon/bipartite_matching.h	(original)
+++ hugo/trunk/lemon/bipartite_matching.h	Thu Jan 25 15:36:21 2007
@@ -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 

Modified: hugo/trunk/lemon/elevator.h
==============================================================================
--- hugo/trunk/lemon/elevator.h	(original)
+++ hugo/trunk/lemon/elevator.h	Thu Jan 25 15:36:21 2007
@@ -35,7 +35,7 @@
   ///A class for handling "labels" in push-relabel type algorithms.
   ///
   ///\ingroup auxdat
-  ///Using this class you can assign "labels" (nonnegativ integer numbers)
+  ///Using this class you can assign "labels" (nonnegative integer numbers)
   ///to the edges or nodes of a graph, manipulate and query them through
   ///operations typically arising in "push-relabel" type algorithms.
   ///