Changeset 2176:0f647e65ecad in lemon-0.x

Timestamp:

08/11/06 16:55:02 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Doc fix

File:

• lemon/min_cut.h (modified) (1 diff)

lemon/min_cut.h

@@ -834 +834 @@
   ///
   /// 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