Index: doc/groups.dox
===================================================================
--- doc/groups.dox (revision 492)
+++ doc/groups.dox (revision 678)
@@ -1,29 +1,66 @@
-/// @defgroup datas Data Structures
-/// This group describes the several graph structures implemented in HugoLib.
+/**
+@defgroup datas Data Structures
+This group describes the several graph structures implemented in HugoLib.
+*/
-/// @defgroup graphs Graph Structures
-/// @ingroup datas
-/// This group describes the graph structures implemented in HugoLib.
+/**
+@defgroup graphs Graph Structures
+@ingroup datas
+\brief Graph structures implemented in Hugo.
-/// @defgroup auxdat Auxiliary Data Structures
-/// @ingroup datas
-/// This group describes the data structures implemented in HugoLib in
-/// order to make it easier to implement combinatorial algorithms.
+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.
-/// @defgroup gwrappers Wrapper Classes for Graphs
-/// @ingroup graphs
-/// This group contains several wrapper classes for graphs
+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.
-/// @defgroup galgs Graph Algorithms
-/// This group describes the several graph algorithms implemented in HugoLib.
+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 misc Miscellaneous Tools
-/// Here you can find several useful tools for development,
-/// debugging and testing.
+/**
+@defgroup auxdat Auxiliary Data Structures
+@ingroup datas
+\brief Some data structures implemented in HugoLib.
-/// @defgroup experimental Experimental Structures and Algorithms
-/// This group contains some Experimental structures and algorithms.
-/// The stuff here is subject to change.
+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
Index: doc/mainpage.dox
===================================================================
--- doc/mainpage.dox (revision 670)
+++ doc/mainpage.dox (revision 678)
@@ -15,6 +15,9 @@
\subsection howtoread How to read this document
-If you are new to HugoLib, you probably should start \ref graphs "here".
-You can also find this page along with other under Related Pages (left-hand
+Graph structures play central role in HugoLib, so if you are new to it,
+you probably should start \ref graphs "here".
+You can also find this page along with others under
+ Related Pages
+(left-hand
side frame).
@@ -22,6 +25,6 @@
interested in details about data structures and algorithms then
you should browse the reference manual part of the documentation.
-The Modules
-section is a good starting point for this.
+Section Modules
+ is a good starting point for this.
*/