Changeset 2428:c06e86364234 in lemon-0.x

Timestamp:

04/20/07 16:47:19 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3264

Message:

Doc change

File:

• lemon/kruskal.h (modified) (3 diffs)

lemon/kruskal.h

@@ -61 +61 @@
   }
 
-  /// \ingroup spantree
-  ///
   /// \brief Default traits class of Kruskal class.
   ///
@@ -108 +106 @@
   };
 
+  ///\ingroup spantree
+  ///
   /// \brief Kruskal's algorithm to find a minimum cost tree of a graph.
   ///
@@ -299 +299 @@
     ///
     /// 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();