1.1 --- a/src/work/johanna/kruskal.h	Thu Aug 05 08:53:09 2004 +0000
     1.2 +++ b/src/work/johanna/kruskal.h	Thu Aug 05 11:38:26 2004 +0000
     1.3 @@ -5,11 +5,22 @@
     1.4  #include <algorithm>
     1.5  #include <hugo/unionfind.h>
     1.6  
     1.7 +/**
     1.8 +@defgroup spantree Minimum Cost Spanning Tree Algorithms
     1.9 +\brief This group containes the algorithms for finding a minimum cost spanning
    1.10 +tree in a graph
    1.11 +@ingroup galgs
    1.12 +*/
    1.13 +
    1.14 +///\ingroup spantree
    1.15  ///\file
    1.16  ///\brief Kruskal's algorithm to compute a minimum cost tree
    1.17  
    1.18  namespace hugo {
    1.19  
    1.20 +  /// \addtogroup spantree
    1.21 +  /// @{
    1.22 +
    1.23    /// Kruskal's algorithm to find a minimum cost tree of a graph.
    1.24  
    1.25    /// This function runs Kruskal's algorithm to find a minimum cost tree.
    1.26 @@ -293,6 +304,7 @@
    1.27      return kruskal(G, iv, out);
    1.28    }
    1.29  
    1.30 +  /// @}
    1.31  
    1.32  } //namespace hugo
    1.33