# HG changeset patch
# User deba
# Date 1177080439 0
# Node ID c06e863642349de42dbec4435fc04c6538c37b01
# Parent  d40c31b08d6feae5ea7d24cc545dd94f45f1e10f
Doc change

diff -r d40c31b08d6f -r c06e86364234 lemon/kruskal.h
--- a/lemon/kruskal.h	Fri Apr 20 14:06:08 2007 +0000
+++ b/lemon/kruskal.h	Fri Apr 20 14:47:19 2007 +0000
@@ -60,8 +60,6 @@
   
   }
 
-  /// \ingroup spantree
-  ///
   /// \brief Default traits class of Kruskal class.
   ///
   /// Default traits class of Kruskal class.
@@ -107,6 +105,8 @@
 
   };
 
+  ///\ingroup spantree
+  ///
   /// \brief Kruskal's algorithm to find a minimum cost tree of a graph.
   ///
   /// This class implements Kruskal's algorithm to find a minimum cost
@@ -298,8 +298,8 @@
     /// \brief Initialize the algorithm
     ///
     /// This member function initializes the unionfind data structure
-    /// and sets the edge order to the given sequence. The given
-    /// sequence should be a valid STL range of undirected edges.
+    /// and sets the tree to empty. It does not change the order of
+    /// the edges, it uses the order of the previous running.
     void reinit() {
       initStructures();
       initUnionFind();