diff -r 8680351d0c28 -r 49b1a30c4dc4 src/work/johanna/kruskal.h
--- a/src/work/johanna/kruskal.h	Thu Aug 05 08:53:09 2004 +0000
+++ b/src/work/johanna/kruskal.h	Thu Aug 05 11:38:26 2004 +0000
@@ -5,11 +5,22 @@
 #include <algorithm>
 #include <hugo/unionfind.h>
 
+/**
+@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
+*/
+
+///\ingroup spantree
 ///\file
 ///\brief Kruskal's algorithm to compute a minimum cost tree
 
 namespace hugo {
 
+  /// \addtogroup spantree
+  /// @{
+
   /// Kruskal's algorithm to find a minimum cost tree of a graph.
 
   /// This function runs Kruskal's algorithm to find a minimum cost tree.
@@ -293,6 +304,7 @@
     return kruskal(G, iv, out);
   }
 
+  /// @}
 
 } //namespace hugo