[Lemon-commits] deba: r3265 - lemon/trunk/lemon

[Lemon SVN]

Author: deba
Date: Fri Apr 20 16:47:19 2007
New Revision: 3265

Modified:
   lemon/trunk/lemon/kruskal.h

Log:
Doc change



Modified: lemon/trunk/lemon/kruskal.h
==============================================================================
--- lemon/trunk/lemon/kruskal.h	(original)
+++ lemon/trunk/lemon/kruskal.h	Fri Apr 20 16:47:19 2007
@@ -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();