diff -r f63e87b9748e -r 0ba8dfce7259 doc/groups.dox
--- a/doc/groups.dox	Tue Apr 21 10:34:49 2009 +0100
+++ b/doc/groups.dox	Tue Apr 21 13:08:19 2009 +0100
@@ -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