Changeset 590:b61354458b59 in lemon-main for doc

Timestamp:

04/15/09 12:01:14 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Imporvements for the matching algorithms (#264)

File:

• doc/groups.dox (modified) (1 diff)

doc/groups.dox

@@ -436 +436 @@
 \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