COIN-OR::LEMON - Graph Library

Changeset 678:a6bfd3346245 in lemon-0.x for doc/groups.dox


Ignore:
Timestamp:
06/14/04 10:35:10 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@926
Message:

New group for kruskal
Better links on the main page.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r492 r678  
    1 /// @defgroup datas Data Structures
    2 /// This group describes the several graph structures implemented in HugoLib.
     1/**
     2@defgroup datas Data Structures
     3This group describes the several graph structures implemented in HugoLib.
     4*/
    35
    4 /// @defgroup graphs Graph Structures
    5 /// @ingroup datas
    6 /// This group describes the graph structures implemented in HugoLib.
     6/**
     7@defgroup graphs Graph Structures
     8@ingroup datas
     9\brief Graph structures implemented in Hugo.
    710
    8 /// @defgroup auxdat Auxiliary Data Structures
    9 /// @ingroup datas
    10 /// This group describes the data structures implemented in HugoLib in
    11 /// order to make it easier to implement combinatorial algorithms.
     11Hugolib provides several data structures to meet the diversing requirements
     12of the possible users.
     13In order to save on running time or on memory usage, some structures may
     14fail to provide
     15some graph features like edge or node deletion.
    1216
    13 /// @defgroup gwrappers Wrapper Classes for Graphs
    14 /// @ingroup graphs
    15 /// This group contains several wrapper classes for graphs
     17Hugolib also offers special graphs that cannot be used alone but only
     18in conjunktion with other graph representation. The examples for this are
     19\ref EdgeSet, \ref NodeSet, and the large variety of graph wrappers.
    1620
    17 /// @defgroup galgs Graph Algorithms
    18 /// This group describes the several graph algorithms implemented in HugoLib.
     21You are free to use the graph structure that fit your requirements
     22the best, most graph algorithms and auxiliary data structures can be used
     23with any graph structures.
     24*/
    1925
    20 /// @defgroup misc Miscellaneous Tools
    21 /// Here you can find several useful tools for development,
    22 /// debugging and testing.
     26/**
     27@defgroup auxdat Auxiliary Data Structures
     28@ingroup datas
     29\brief Some data structures implemented in HugoLib.
    2330
    24 /// @defgroup experimental Experimental Structures and Algorithms
    25 /// This group contains some Experimental structures and algorithms.
    26 /// The stuff here is subject to change.
     31This group describes the data structures implemented in HugoLib in
     32order to make it easier to implement combinatorial algorithms.
     33*/
    2734
     35/**
     36@defgroup gwrappers Wrapper Classes for Graphs
     37\brief This group contains several wrapper classes for graphs
     38@ingroup graphs
     39*/
     40
     41/**
     42@defgroup galgs Graph Algorithms
     43\brief This group describes the several graph algorithms
     44implemented in HugoLib.
     45*/
     46
     47/**
     48@defgroup spantree Minimum Cost Spanning Tree Algorithms
     49\brief This group containes the algorithms for finding a minimum cost spanning
     50tree in a graph
     51@ingroup galgs
     52*/
     53
     54/**
     55@defgroup misc Miscellaneous Tools
     56Here you can find several useful tools for development,
     57debugging and testing.
     58*/
     59
     60/**
     61@defgroup experimental Experimental Structures and Algorithms
     62This group contains some Experimental structures and algorithms.
     63The stuff here is subject to change.
     64*/
    2865
    2966/// \ingroup misc experimental
Note: See TracChangeset for help on using the changeset viewer.