1.1 --- a/doc/groups.dox Tue Mar 16 21:18:39 2010 +0100
1.2 +++ b/doc/groups.dox Tue Mar 16 21:27:35 2010 +0100
1.3 @@ -386,7 +386,7 @@
1.4 also provide functions to query the minimum cut, which is the dual
1.5 problem of maximum flow.
1.6
1.7 -\ref Circulation is a preflow push-relabel algorithm implemented directly
1.8 +\ref Circulation is a preflow push-relabel algorithm implemented directly
1.9 for finding feasible circulations, which is a somewhat different problem,
1.10 but it is strongly related to maximum flow.
1.11 For more information, see \ref Circulation.
1.12 @@ -522,6 +522,13 @@
1.13 - \ref MaxWeightedPerfectMatching
1.14 Edmond's blossom shrinking algorithm for calculating maximum weighted
1.15 perfect matching in general graphs.
1.16 +- \ref MaxFractionalMatching Push-relabel algorithm for calculating
1.17 + maximum cardinality fractional matching in general graphs.
1.18 +- \ref MaxWeightedFractionalMatching Augmenting path algorithm for calculating
1.19 + maximum weighted fractional matching in general graphs.
1.20 +- \ref MaxWeightedPerfectFractionalMatching
1.21 + Augmenting path algorithm for calculating maximum weighted
1.22 + perfect fractional matching in general graphs.
1.23
1.24 \image html matching.png
1.25 \image latex matching.eps "Min Cost Perfect Matching" width=\textwidth