doc/groups.dox
changeset 637 b61354458b59
parent 633 7c12061bd271
child 658 85cb3aa71cce
     1.1 --- a/doc/groups.dox	Wed Apr 15 07:13:30 2009 +0100
     1.2 +++ b/doc/groups.dox	Wed Apr 15 12:01:14 2009 +0200
     1.3 @@ -435,9 +435,10 @@
     1.4  @ingroup algs
     1.5  \brief Algorithms for finding matchings in graphs and bipartite graphs.
     1.6  
     1.7 -This group contains algorithm objects and functions to calculate
     1.8 +This group contains the algorithms for calculating
     1.9  matchings in graphs and bipartite graphs. The general matching problem is
    1.10 -finding a subset of the arcs which does not shares common endpoints.
    1.11 +finding a subset of the edges for which each node has at most one incident
    1.12 +edge.
    1.13  
    1.14  There are several different algorithms for calculate matchings in
    1.15  graphs.  The matching problems in bipartite graphs are generally