1.1 --- a/lemon/kruskal.h	Fri Apr 20 14:06:08 2007 +0000
     1.2 +++ b/lemon/kruskal.h	Fri Apr 20 14:47:19 2007 +0000
     1.3 @@ -60,8 +60,6 @@
     1.4    
     1.5    }
     1.6  
     1.7 -  /// \ingroup spantree
     1.8 -  ///
     1.9    /// \brief Default traits class of Kruskal class.
    1.10    ///
    1.11    /// Default traits class of Kruskal class.
    1.12 @@ -107,6 +105,8 @@
    1.13  
    1.14    };
    1.15  
    1.16 +  ///\ingroup spantree
    1.17 +  ///
    1.18    /// \brief Kruskal's algorithm to find a minimum cost tree of a graph.
    1.19    ///
    1.20    /// This class implements Kruskal's algorithm to find a minimum cost
    1.21 @@ -298,8 +298,8 @@
    1.22      /// \brief Initialize the algorithm
    1.23      ///
    1.24      /// This member function initializes the unionfind data structure
    1.25 -    /// and sets the edge order to the given sequence. The given
    1.26 -    /// sequence should be a valid STL range of undirected edges.
    1.27 +    /// and sets the tree to empty. It does not change the order of
    1.28 +    /// the edges, it uses the order of the previous running.
    1.29      void reinit() {
    1.30        initStructures();
    1.31        initUnionFind();