1.1 --- a/doc/groups.dox Sun Sep 20 21:38:24 2009 +0200
1.2 +++ b/doc/groups.dox Fri Sep 25 21:51:36 2009 +0200
1.3 @@ -349,7 +349,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 @@ -470,6 +470,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 bipartite_matching.png
1.25 \image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth