# HG changeset patch
# User deba
# Date 1155308102 0
# Node ID 0f647e65ecad0f3a1646edb7fcc67a444410ea89
# Parent  0975cad06c2be0d16905036111ddbd75169eefa2
Doc fix

diff -r 0975cad06c2b -r 0f647e65ecad lemon/min_cut.h
--- a/lemon/min_cut.h	Thu Aug 10 13:54:01 2006 +0000
+++ b/lemon/min_cut.h	Fri Aug 11 14:55:02 2006 +0000
@@ -833,11 +833,11 @@
   /// \brief Calculates the min cut in an undirected graph.
   ///
   /// Calculates the min cut in an undirected graph. 
-  /// The algorithm separates the graph's nodes to two partitions with the 
+  /// The algorithm separates the graph's nodes into two partitions with the 
   /// min sum of edge capacities between the two partitions. The
-  /// algorithm can be used to test the netaux reliability specifically
-  /// to test how many links have to be destroyed in the netaux to split it 
-  /// at least two distinict subnetaux.
+  /// algorithm can be used to test the network reliability specifically
+  /// to test how many links have to be destroyed in the network to split it 
+  /// at least two distinict subnetwork.
   ///
   /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with
   /// Fibonacci heap it can be decreased to \f$ O(ne+n^2\log(n)) \f$. When