Changeset 2176:0f647e65ecad in lemon0.x for lemon/min_cut.h
 Timestamp:
 08/11/06 16:55:02 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2892
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/min_cut.h
r2151 r2176 834 834 /// 835 835 /// Calculates the min cut in an undirected graph. 836 /// The algorithm separates the graph's nodes to two partitions with the836 /// The algorithm separates the graph's nodes into two partitions with the 837 837 /// min sum of edge capacities between the two partitions. The 838 /// algorithm can be used to test the net auxreliability specifically839 /// to test how many links have to be destroyed in the net auxto split it840 /// at least two distinict subnet aux.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. 841 841 /// 842 842 /// The complexity of the algorithm is \f$ O(ne\log(n)) \f$ but with
Note: See TracChangeset
for help on using the changeset viewer.