1.1 --- a/lemon/kruskal.h	Mon May 15 09:46:33 2006 +0000
     1.2 +++ b/lemon/kruskal.h	Mon May 15 09:49:51 2006 +0000
     1.3 @@ -25,16 +25,6 @@
     1.4  #include <lemon/bits/utility.h>
     1.5  #include <lemon/bits/traits.h>
     1.6  
     1.7 -/**
     1.8 -@defgroup spantree Minimum Cost Spanning Tree Algorithms
     1.9 -@ingroup galgs
    1.10 -\brief This group containes the algorithms for finding a minimum cost spanning
    1.11 -tree in a graph
    1.12 -
    1.13 -This group containes the algorithms for finding a minimum cost spanning
    1.14 -tree in a graph
    1.15 -*/
    1.16 -
    1.17  ///\ingroup spantree
    1.18  ///\file
    1.19  ///\brief Kruskal's algorithm to compute a minimum cost tree