COIN-OR::LEMON - Graph Library

Changeset 2176:0f647e65ecad in lemon-0.x for lemon


Ignore:
Timestamp:
08/11/06 16:55:02 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2892
Message:

Doc fix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cut.h

    r2151 r2176  
    834834  ///
    835835  /// Calculates the min cut in an undirected graph.
    836   /// The algorithm separates the graph's nodes to two partitions with the
     836  /// The algorithm separates the graph's nodes into two partitions with the
    837837  /// min sum of edge capacities between the two partitions. The
    838   /// algorithm can be used to test the netaux reliability specifically
    839   /// to test how many links have to be destroyed in the netaux to split it
    840   /// at least two distinict subnetaux.
     838  /// algorithm can be used to test the network reliability specifically
     839  /// to test how many links have to be destroyed in the network to split it
     840  /// at least two distinict subnetwork.
    841841  ///
    842842  /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with
Note: See TracChangeset for help on using the changeset viewer.