Changeset 2352:5e273e0bd5e2 in lemon-0.x for lemon/bipartite_matching.h

Timestamp:

01/25/07 15:36:21 (16 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3148

Message:

Doc improvements

File:

• lemon/bipartite_matching.h (modified) (3 diffs)

lemon/bipartite_matching.h

@@ -165 +165 @@
     ///
     /// 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
@@ -259 +259 @@
     ///
     /// 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 
@@ -735 +735 @@
     ///
     /// 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. 
     ///