Index: doc/groups.dox
===================================================================
--- doc/groups.dox (revision 586)
+++ doc/groups.dox (revision 590)
@@ -436,7 +436,8 @@
\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