Changeset 1973:30c97275f337 in lemon-0.x

Timestamp:

02/20/06 07:43:08 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Spellchecking

File:

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

lemon/minimum_cut.h

@@ -155 +155 @@
   /// 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.
@@ -1305 +1305 @@
     /// 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 { 
@@ -1332 +1332 @@
     /// \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 {