COIN-OR::LEMON - Graph Library

Changeset 236:da953e387d31 in lemon-1.0 for doc/groups.dox


Ignore:
Timestamp:
07/28/08 13:39:58 (11 years ago)
Author:
Akos Ladanyi <ladanyi@…>
Branch:
default
Phase:
public
Message:

Unify the spelling of LEMON (#103).

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r210 r236  
    326326maximum cardinality matching.
    327327
    328 Lemon contains the next algorithms:
     328LEMON contains the next algorithms:
    329329- \ref lemon::MaxBipartiteMatching "MaxBipartiteMatching" Hopcroft-Karp
    330330  augmenting path algorithm for calculate maximum cardinality matching in
     
    477477
    478478/**
    479 @defgroup lemon_io Lemon Input-Output
     479@defgroup lemon_io LEMON Input-Output
    480480@ingroup io_group
    481 \brief Reading and writing \ref lgf-format "Lemon Graph Format".
     481\brief Reading and writing \ref lgf-format "LEMON Graph Format".
    482482
    483483This group describes methods for reading and writing
    484 \ref lgf-format "Lemon Graph Format".
     484\ref lgf-format "LEMON Graph Format".
    485485*/
    486486
Note: See TracChangeset for help on using the changeset viewer.