1.1 --- a/lemon/minimum_cut.h	Mon Feb 20 06:42:29 2006 +0000
     1.2 +++ b/lemon/minimum_cut.h	Mon Feb 20 06:43:08 2006 +0000
     1.3 @@ -154,10 +154,10 @@
     1.4    ///
     1.5    /// This class provides an efficient implementation of Maximum Cardinality 
     1.6    /// Search algorithm. The maximum cardinality search chooses first time any 
     1.7 -  /// node of the graph. Then every time chooses that node which connected
     1.8 +  /// node of the graph. Then every time it chooses the node which is connected
     1.9    /// to the processed nodes at most in the sum of capacities on the out 
    1.10    /// edges. If there is a cut in the graph the algorithm should choose
    1.11 -  /// again any unprocessed node of the graph. Each nodes cardinality is
    1.12 +  /// again any unprocessed node of the graph. Each node cardinality is
    1.13    /// the sum of capacities on the out edges to the nodes which are processed
    1.14    /// before the given node.
    1.15    ///
    1.16 @@ -1304,7 +1304,7 @@
    1.17      ///
    1.18      /// It sets the nodes of one of the two partitions to true in
    1.19      /// the given BoolNodeMap. The map contains a valid cut if the
    1.20 -    /// map have been setted false previously. 
    1.21 +    /// map have been set false previously. 
    1.22      template <typename NodeMap>
    1.23      Value quickMinCut(NodeMap& nodeMap) const { 
    1.24        for (typename Graph::Node it = _first_node; 
    1.25 @@ -1331,8 +1331,8 @@
    1.26  
    1.27      /// \brief Returns a minimum cut in an EdgeMap.
    1.28      ///
    1.29 -    /// If an undirected edge is cut edge then it will be
    1.30 -    /// setted to true and the others will be setted to false in the given map.
    1.31 +    /// If an undirected edge is in a minimum cut then it will be
    1.32 +    /// set to true and the others will be set to false in the given map.
    1.33      template <typename EdgeMap>
    1.34      Value cutEdges(EdgeMap& edgeMap) const {
    1.35        typename Graph::template NodeMap<bool> cut(*_graph, false);