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

Timestamp:

09/29/04 17:30:04 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232

Message:

hugo -> lemon

File:

• doc/groups.dox (modified) (6 diffs)

doc/groups.dox

@@ -2 +2 @@
 /**
 @defgroup datas Data Structures
-This group describes the several graph structures implemented in HugoLib.
+This group describes the several graph structures implemented in LEMON.
 */
 
@@ -8 +8 @@
 @defgroup graphs Graph Structures
 @ingroup datas
-\brief Graph structures implemented in Hugo.
+\brief Graph structures implemented in LEMON.
 
-Hugolib provides several data structures to meet the diverging requirements
+LEMON provides several data structures to meet the diverging requirements
 of the possible users.
 In order to save on running time or on memory usage, some structures may
@@ -16 +16 @@
 some graph features like edge or node deletion.
 
-Hugolib also offers special graphs that cannot be used alone but only
+LEMON also offers special graphs that cannot be used alone but only
 in conjunction with other graph representation. The examples for this are
-\ref hugo::EdgeSet "EdgeSet", \ref hugo::NodeSet "NodeSet"
+\ref lemon::EdgeSet "EdgeSet", \ref lemon::NodeSet "NodeSet"
 and the large variety of \ref gwrappers "graph wrappers".
 
@@ -29 +29 @@
 @defgroup auxdat Auxiliary Data Structures
 @ingroup datas
-\brief Some data structures implemented in HugoLib.
+\brief Some data structures implemented in LEMON.
 
-This group describes the data structures implemented in HugoLib in
+This group describes the data structures implemented in LEMON in
 order to make it easier to implement combinatorial algorithms.
 */
@@ -53 +53 @@
 @defgroup galgs Graph Algorithms
 \brief This group describes the several graph algorithms
-implemented in HugoLib.
+implemented in LEMON.
 */
 
@@ -73 +73 @@
 \brief Skeletons (a.k.a. concept checking classes)
 
-This group describes the data/algorithm skeletons implemented in HugoLib in
+This group describes the data/algorithm skeletons implemented in LEMON in
 order to make it easier to check if a certain template class or
 template function is correctly implemented.