diff -r 630c4898c548 -r b61354458b59 doc/groups.dox
--- a/doc/groups.dox	Wed Apr 15 07:13:30 2009 +0100
+++ b/doc/groups.dox	Wed Apr 15 12:01:14 2009 +0200
@@ -435,9 +435,10 @@
 @ingroup algs
 \brief Algorithms for finding matchings in graphs and bipartite graphs.
 
-This group contains algorithm objects and functions to calculate
+This group contains the algorithms for calculating
 matchings in graphs and bipartite graphs. The general matching problem is
-finding a subset of the arcs which does not shares common endpoints.
+finding a subset of the edges for which each node has at most one incident
+edge.
 
 There are several different algorithms for calculate matchings in
 graphs.  The matching problems in bipartite graphs are generally