COIN-OR::LEMON - Graph Library

Changeset 921:818510fa3d99 in lemon-0.x for doc/groups.dox


Ignore:
Timestamp:
09/29/04 17:30:04 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
Message:

hugo -> lemon

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r814 r921  
    22/**
    33@defgroup datas Data Structures
    4 This group describes the several graph structures implemented in HugoLib.
     4This group describes the several graph structures implemented in LEMON.
    55*/
    66
     
    88@defgroup graphs Graph Structures
    99@ingroup datas
    10 \brief Graph structures implemented in Hugo.
     10\brief Graph structures implemented in LEMON.
    1111
    12 Hugolib provides several data structures to meet the diverging requirements
     12LEMON provides several data structures to meet the diverging requirements
    1313of the possible users.
    1414In order to save on running time or on memory usage, some structures may
     
    1616some graph features like edge or node deletion.
    1717
    18 Hugolib also offers special graphs that cannot be used alone but only
     18LEMON also offers special graphs that cannot be used alone but only
    1919in conjunction with other graph representation. The examples for this are
    20 \ref hugo::EdgeSet "EdgeSet", \ref hugo::NodeSet "NodeSet"
     20\ref lemon::EdgeSet "EdgeSet", \ref lemon::NodeSet "NodeSet"
    2121and the large variety of \ref gwrappers "graph wrappers".
    2222
     
    2929@defgroup auxdat Auxiliary Data Structures
    3030@ingroup datas
    31 \brief Some data structures implemented in HugoLib.
     31\brief Some data structures implemented in LEMON.
    3232
    33 This group describes the data structures implemented in HugoLib in
     33This group describes the data structures implemented in LEMON in
    3434order to make it easier to implement combinatorial algorithms.
    3535*/
     
    5353@defgroup galgs Graph Algorithms
    5454\brief This group describes the several graph algorithms
    55 implemented in HugoLib.
     55implemented in LEMON.
    5656*/
    5757
     
    7373\brief Skeletons (a.k.a. concept checking classes)
    7474
    75 This group describes the data/algorithm skeletons implemented in HugoLib in
     75This group describes the data/algorithm skeletons implemented in LEMON in
    7676order to make it easier to check if a certain template class or
    7777template function is correctly implemented.
Note: See TracChangeset for help on using the changeset viewer.