3 @defgroup datas Data Structures
4 This group describes the several graph structures implemented in LEMON.
8 @defgroup graphs Graph Structures
10 \brief Graph structures implemented in LEMON.
12 LEMON provides several data structures to meet the diverging requirements
13 of the possible users.
14 In order to save on running time or on memory usage, some structures may
16 some graph features like edge or node deletion.
18 LEMON also offers special graphs that cannot be used alone but only
19 in conjunction with other graph representation. The examples for this are
20 \ref lemon::EdgeSet "EdgeSet", \ref lemon::NodeSet "NodeSet"
21 and the large variety of \ref gwrappers "graph wrappers".
23 You are free to use the graph structure that fit your requirements
24 the best, most graph algorithms and auxiliary data structures can be used
25 with any graph structures.
31 \brief Some special purpose map to make life easier.
33 LEMON provides several special maps that e.g. combine
34 new maps from existing ones.
38 @defgroup auxdat Auxiliary Data Structures
40 \brief Some data structures implemented in LEMON.
42 This group describes the data structures implemented in LEMON in
43 order to make it easier to implement combinatorial algorithms.
47 @defgroup graphmapfactory Tools to Make It Easier to Make Graph Maps
49 \brief Tools to Make It Easier to Make Graph Maps.
51 This group describes the tools that makes it easier to make graph maps that
52 dynamically update with the graph changes.
56 @defgroup gwrappers Wrapper Classes for Graphs
57 \brief This group contains several wrapper classes for graphs
62 @defgroup galgs Graph Algorithms
63 \brief This group describes the several graph algorithms
66 This group describes the several graph algorithms
71 @defgroup gutils General Graph Utilities
72 \brief This group describes some simple general graph utilities.
75 This group describes some simple general graph utilities.
79 @defgroup flowalgs Path and Flow Algorithms
81 \brief This group describes the algorithms
82 for finding paths and flows in graphs.
86 @defgroup misc Miscellaneous Tools
87 Here you can find several useful tools for development,
88 debugging and testing.
92 @defgroup concept Concepts
93 \brief Skeleton classes and concept checking classes
95 This group describes the data/algorithm skeletons and concept checking
96 classes implemented in LEMON.
98 One aim of these classes is to make it easier to check if a certain
99 class or template function is correctly implemented.
101 The other (sometimes even more important) aim is to document the concepts.
106 @defgroup graph_concepts Graph Structure Concepts
108 \brief Skeleton and concept checking classes for graph structures
110 This group contains the skeletons and concept checking classes of LEMON's
111 graph structures and helper classes used to implement these.
115 @defgroup experimental Experimental Structures and Algorithms
116 This group contains some Experimental structures and algorithms.
117 The stuff here is subject to change.