[Lemon-commits] [lemon_svn] deba: r2892 - hugo/trunk/lemon

[Lemon SVN]

Author: deba
Date: Fri Aug 11 16:55:02 2006
New Revision: 2892

Modified:
   hugo/trunk/lemon/min_cut.h

Log:
Doc fix




Modified: hugo/trunk/lemon/min_cut.h
==============================================================================
--- hugo/trunk/lemon/min_cut.h	(original)
+++ hugo/trunk/lemon/min_cut.h	Fri Aug 11 16:55:02 2006
@@ -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