COIN-OR::LEMON - Graph Library

source: lemon-0.x/doc/groups.dox @ 678:a6bfd3346245

Last change on this file since 678:a6bfd3346245 was 678:a6bfd3346245, checked in by Alpar Juttner, 16 years ago

New group for kruskal
Better links on the main page.

File size: 1.8 KB
Line 
1/**
2@defgroup datas Data Structures
3This group describes the several graph structures implemented in HugoLib.
4*/
5
6/**
7@defgroup graphs Graph Structures
8@ingroup datas
9\brief Graph structures implemented in Hugo.
10
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.
16
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.
20
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*/
25
26/**
27@defgroup auxdat Auxiliary Data Structures
28@ingroup datas
29\brief Some data structures implemented in HugoLib.
30
31This group describes the data structures implemented in HugoLib in
32order to make it easier to implement combinatorial algorithms.
33*/
34
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*/
65
66/// \ingroup misc experimental
67namespace hugo { }
Note: See TracBrowser for help on using the repository browser.