/**
@defgroup datas Data Structures
This group describes the several graph structures implemented in HugoLib.
*/

/**
@defgroup graphs Graph Structures
@ingroup datas
\brief Graph structures implemented in Hugo.

Hugolib provides several data structures to meet the diversing requirements
of the possible users.
In order to save on running time or on memory usage, some structures may
fail to provide
some graph features like edge or node deletion.

Hugolib also offers special graphs that cannot be used alone but only
in conjunktion with other graph representation. The examples for this are
\ref EdgeSet, \ref NodeSet, and the large variety of graph wrappers.

You are free to use the graph structure that fit your requirements
the best, most graph algorithms and auxiliary data structures can be used
with any graph structures.
*/

/**
@defgroup auxdat Auxiliary Data Structures
@ingroup datas
\brief Some data structures implemented in HugoLib.

This group describes the data structures implemented in HugoLib in
order to make it easier to implement combinatorial algorithms.
*/

/**
@defgroup gwrappers Wrapper Classes for Graphs
\brief This group contains several wrapper classes for graphs
@ingroup graphs
*/

/**
@defgroup galgs Graph Algorithms
\brief This group describes the several graph algorithms
implemented in HugoLib.
*/

/**
@defgroup spantree Minimum Cost Spanning Tree Algorithms
\brief This group containes the algorithms for finding a minimum cost spanning
tree in a graph
@ingroup galgs
*/

/**
@defgroup misc Miscellaneous Tools
Here you can find several useful tools for development,
debugging and testing.
*/

/**
@defgroup experimental Experimental Structures and Algorithms
This group contains some Experimental structures and algorithms.
The stuff here is subject to change.
*/

/// \ingroup misc experimental
namespace hugo { }