doc/groups.dox
changeset 954 07ec2b52e53d
parent 952 23da1b807280
parent 948 636dadefe1e6
child 956 141f9c0db4a3
equal deleted inserted replaced
49:9fe79dcd2615 50:0625169aac5d
   384 In most cases the \ref Preflow algorithm provides the
   384 In most cases the \ref Preflow algorithm provides the
   385 fastest method for computing a maximum flow. All implementations
   385 fastest method for computing a maximum flow. All implementations
   386 also provide functions to query the minimum cut, which is the dual
   386 also provide functions to query the minimum cut, which is the dual
   387 problem of maximum flow.
   387 problem of maximum flow.
   388 
   388 
   389 \ref Circulation is a preflow push-relabel algorithm implemented directly 
   389 \ref Circulation is a preflow push-relabel algorithm implemented directly
   390 for finding feasible circulations, which is a somewhat different problem,
   390 for finding feasible circulations, which is a somewhat different problem,
   391 but it is strongly related to maximum flow.
   391 but it is strongly related to maximum flow.
   392 For more information, see \ref Circulation.
   392 For more information, see \ref Circulation.
   393 */
   393 */
   394 
   394 
   520 - \ref MaxWeightedMatching Edmond's blossom shrinking algorithm for calculating
   520 - \ref MaxWeightedMatching Edmond's blossom shrinking algorithm for calculating
   521   maximum weighted matching in general graphs.
   521   maximum weighted matching in general graphs.
   522 - \ref MaxWeightedPerfectMatching
   522 - \ref MaxWeightedPerfectMatching
   523   Edmond's blossom shrinking algorithm for calculating maximum weighted
   523   Edmond's blossom shrinking algorithm for calculating maximum weighted
   524   perfect matching in general graphs.
   524   perfect matching in general graphs.
       
   525 - \ref MaxFractionalMatching Push-relabel algorithm for calculating
       
   526   maximum cardinality fractional matching in general graphs.
       
   527 - \ref MaxWeightedFractionalMatching Augmenting path algorithm for calculating
       
   528   maximum weighted fractional matching in general graphs.
       
   529 - \ref MaxWeightedPerfectFractionalMatching
       
   530   Augmenting path algorithm for calculating maximum weighted
       
   531   perfect fractional matching in general graphs.
   525 
   532 
   526 \image html matching.png
   533 \image html matching.png
   527 \image latex matching.eps "Min Cost Perfect Matching" width=\textwidth
   534 \image latex matching.eps "Min Cost Perfect Matching" width=\textwidth
   528 */
   535 */
   529 
   536