Changeset 2176:0f647e65ecad in lemon-0.x

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

Doc fix

File:
1 edited

Unmodified
Added
Removed
• lemon/min_cut.h

 r2151 /// /// 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
Note: See TracChangeset for help on using the changeset viewer.