1.1 --- a/doc/groups.dox	Thu Dec 27 13:40:16 2007 +0000
     1.2 +++ b/doc/groups.dox	Fri Dec 28 11:00:51 2007 +0000
     1.3 @@ -318,8 +318,37 @@
     1.4  \brief This group describes the algorithms
     1.5  for find matchings in graphs and bipartite graphs.
     1.6  
     1.7 -This group provides some algorithm objects and function
     1.8 -to calculate matchings in graphs and bipartite graphs.
     1.9 +This group provides some algorithm objects and function to calculate
    1.10 +matchings in graphs and bipartite graphs. The general matching problem is
    1.11 +finding a subset of the edges which does not shares common endpoints.
    1.12 + 
    1.13 +There are several different algorithms for calculate matchings in
    1.14 +graphs.  The matching problems in bipartite graphs are generally
    1.15 +easier than in general graphs. The goal of the matching optimization
    1.16 +can be the finding maximum cardinality, maximum weight or minimum cost
    1.17 +matching. The search can be constrained to find perfect or
    1.18 +maximum cardinality matching.
    1.19 +
    1.20 +Lemon contains the next algorithms:
    1.21 +- \ref lemon::MaxBipartiteMatching "MaxBipartiteMatching" Hopcroft-Karp 
    1.22 +  augmenting path algorithm for calculate maximum cardinality matching in 
    1.23 +  bipartite graphs
    1.24 +- \ref lemon::PrBipartiteMatching "PrBipartiteMatching" Push-Relabel 
    1.25 +  algorithm for calculate maximum cardinality matching in bipartite graphs 
    1.26 +- \ref lemon::MaxWeightedBipartiteMatching "MaxWeightedBipartiteMatching" 
    1.27 +  Successive shortest path algorithm for calculate maximum weighted matching 
    1.28 +  and maximum weighted bipartite matching in bipartite graph
    1.29 +- \ref lemon::MinCostMaxBipartiteMatching "MinCostMaxBipartiteMatching" 
    1.30 +  Successive shortest path algorithm for calculate minimum cost maximum 
    1.31 +  matching in bipartite graph
    1.32 +- \ref lemon::MaxMatching "MaxMatching" Edmond's blossom shrinking algorithm
    1.33 +  for calculate maximum cardinality matching in general graph
    1.34 +- \ref lemon::MaxWeightedMatching "MaxWeightedMatching" Edmond's blossom
    1.35 +  shrinking algorithm for calculate maximum weighted matching in general
    1.36 +  graph
    1.37 +- \ref lemon::MaxWeightedPerfectMatching "MaxWeightedPerfectMatching"
    1.38 +  Edmond's blossom shrinking algorithm for calculate maximum weighted
    1.39 +  perfect matching in general graph
    1.40  
    1.41  \image html bipartite_matching.png
    1.42  \image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth