1.1 --- a/doc/groups.dox Tue Jul 29 14:41:55 2008 +0200
1.2 +++ b/doc/groups.dox Tue Jul 29 15:06:37 2008 +0200
1.3 @@ -325,7 +325,7 @@
1.4 matching. The search can be constrained to find perfect or
1.5 maximum cardinality matching.
1.6
1.7 -Lemon contains the next algorithms:
1.8 +LEMON contains the next algorithms:
1.9 - \ref lemon::MaxBipartiteMatching "MaxBipartiteMatching" Hopcroft-Karp
1.10 augmenting path algorithm for calculate maximum cardinality matching in
1.11 bipartite graphs
1.12 @@ -476,12 +476,12 @@
1.13 */
1.14
1.15 /**
1.16 -@defgroup lemon_io Lemon Input-Output
1.17 +@defgroup lemon_io LEMON Input-Output
1.18 @ingroup io_group
1.19 -\brief Reading and writing \ref lgf-format "Lemon Graph Format".
1.20 +\brief Reading and writing \ref lgf-format "LEMON Graph Format".
1.21
1.22 This group describes methods for reading and writing
1.23 -\ref lgf-format "Lemon Graph Format".
1.24 +\ref lgf-format "LEMON Graph Format".
1.25 */
1.26
1.27 /**