[Lemon-commits] [lemon_svn] alpar: r2557 - hugo/trunk/lemon

[Lemon SVN]

Author: alpar
Date: Mon Feb 20 07:43:08 2006
New Revision: 2557

Modified:
   hugo/trunk/lemon/minimum_cut.h

Log:
Spellchecking

Modified: hugo/trunk/lemon/minimum_cut.h
==============================================================================
--- hugo/trunk/lemon/minimum_cut.h	(original)
+++ hugo/trunk/lemon/minimum_cut.h	Mon Feb 20 07:43:08 2006
@@ -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);