1.1 --- a/lemon/min_cut.h	Thu Aug 10 13:54:01 2006 +0000
     1.2 +++ b/lemon/min_cut.h	Fri Aug 11 14:55:02 2006 +0000
     1.3 @@ -833,11 +833,11 @@
     1.4    /// \brief Calculates the min cut in an undirected graph.
     1.5    ///
     1.6    /// Calculates the min cut in an undirected graph. 
     1.7 -  /// The algorithm separates the graph's nodes to two partitions with the 
     1.8 +  /// The algorithm separates the graph's nodes into two partitions with the 
     1.9    /// min sum of edge capacities between the two partitions. The
    1.10 -  /// algorithm can be used to test the netaux reliability specifically
    1.11 -  /// to test how many links have to be destroyed in the netaux to split it 
    1.12 -  /// at least two distinict subnetaux.
    1.13 +  /// algorithm can be used to test the network reliability specifically
    1.14 +  /// to test how many links have to be destroyed in the network to split it 
    1.15 +  /// at least two distinict subnetwork.
    1.16    ///
    1.17    /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with
    1.18    /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When