Changeset 2352:5e273e0bd5e2 in lemon0.x for lemon/bipartite_matching.h
 Timestamp:
 01/25/07 15:36:21 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3148
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bipartite_matching.h
r2269 r2352 165 165 /// 166 166 /// It runs an augmenting phase of the HopcroftKarp 167 /// algorithm. Th ephase finds maximum count of edge disjoint167 /// algorithm. This phase finds maximum count of edge disjoint 168 168 /// augmenting paths and augments on these paths. The algorithm 169 169 /// consists at most of \f$ O(\sqrt{n}) \f$ phase and one phase is … … 259 259 /// 260 260 /// It runs an augmenting phase of the FordFulkerson 261 /// algorithm. Th ephase finds only one augmenting path and261 /// algorithm. This phase finds only one augmenting path and 262 262 /// augments only on this paths. The algorithm consists at most 263 263 /// of \f$ O(n) \f$ simple phase and one phase is at most … … 735 735 /// 736 736 /// It runs an augmenting phase of the weighted matching 737 /// algorithm. Th ephase finds the best augmenting path and737 /// algorithm. This phase finds the best augmenting path and 738 738 /// augments only on this paths. 739 739 ///
Note: See TracChangeset
for help on using the changeset viewer.