# HG changeset patch
# User alpar
# Date 1140417788 0
# Node ID 30c97275f33764c008136e2ccee47eafc4385154
# Parent  487a868e30e5736c15e14064a1c7b5956b2a7d2a
Spellchecking

diff -r 487a868e30e5 -r 30c97275f337 lemon/minimum_cut.h
--- a/lemon/minimum_cut.h	Mon Feb 20 06:42:29 2006 +0000
+++ b/lemon/minimum_cut.h	Mon Feb 20 06:43:08 2006 +0000
@@ -154,10 +154,10 @@
   ///
   /// This class provides an efficient implementation of Maximum Cardinality 
   /// Search algorithm. The maximum cardinality search chooses first time any 
-  /// node of the graph. Then every time chooses that node which connected
+  /// node of the graph. Then every time it chooses the node which is connected
   /// to the processed nodes at most in the sum of capacities on the out 
   /// edges. If there is a cut in the graph the algorithm should choose
-  /// again any unprocessed node of the graph. Each nodes cardinality is
+  /// again any unprocessed node of the graph. Each node cardinality is
   /// the sum of capacities on the out edges to the nodes which are processed
   /// before the given node.
   ///
@@ -1304,7 +1304,7 @@
     ///
     /// It sets the nodes of one of the two partitions to true in
     /// the given BoolNodeMap. The map contains a valid cut if the
-    /// map have been setted false previously. 
+    /// map have been set false previously. 
     template <typename NodeMap>
     Value quickMinCut(NodeMap& nodeMap) const { 
       for (typename Graph::Node it = _first_node; 
@@ -1331,8 +1331,8 @@
 
     /// \brief Returns a minimum cut in an EdgeMap.
     ///
-    /// If an undirected edge is cut edge then it will be
-    /// setted to true and the others will be setted to false in the given map.
+    /// If an undirected edge is in a minimum cut then it will be
+    /// set to true and the others will be set to false in the given map.
     template <typename EdgeMap>
     Value cutEdges(EdgeMap& edgeMap) const {
       typename Graph::template NodeMap<bool> cut(*_graph, false);