Changeset 1973:30c97275f337 in lemon0.x for lemon/minimum_cut.h
 Timestamp:
 02/20/06 07:43:08 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2557
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/minimum_cut.h
r1968 r1973 155 155 /// This class provides an efficient implementation of Maximum Cardinality 156 156 /// Search algorithm. The maximum cardinality search chooses first time any 157 /// node of the graph. Then every time chooses that node whichconnected157 /// node of the graph. Then every time it chooses the node which is connected 158 158 /// to the processed nodes at most in the sum of capacities on the out 159 159 /// edges. If there is a cut in the graph the algorithm should choose 160 /// again any unprocessed node of the graph. Each node scardinality is160 /// again any unprocessed node of the graph. Each node cardinality is 161 161 /// the sum of capacities on the out edges to the nodes which are processed 162 162 /// before the given node. … … 1305 1305 /// It sets the nodes of one of the two partitions to true in 1306 1306 /// the given BoolNodeMap. The map contains a valid cut if the 1307 /// map have been set tedfalse previously.1307 /// map have been set false previously. 1308 1308 template <typename NodeMap> 1309 1309 Value quickMinCut(NodeMap& nodeMap) const { … … 1332 1332 /// \brief Returns a minimum cut in an EdgeMap. 1333 1333 /// 1334 /// If an undirected edge is cut edgethen it will be1335 /// set ted to true and the others will be settedto false in the given map.1334 /// If an undirected edge is in a minimum cut then it will be 1335 /// set to true and the others will be set to false in the given map. 1336 1336 template <typename EdgeMap> 1337 1337 Value cutEdges(EdgeMap& edgeMap) const {
Note: See TracChangeset
for help on using the changeset viewer.