Changeset 875:07ec2b52e53d in lemon-1.2 for lemon/unionfind.h

Timestamp:

03/17/10 10:29:57 (14 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Parents:

874:d8ea85825e02 (diff), 867:5b926cc36a4b (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Phase:

public

Message:

Merge #356

Files:

• lemon/unionfind.h (modified) (1 diff)
• lemon/unionfind.h (modified) (1 diff)

lemon/unionfind.h

@@ -44 +44 @@
   /// This is a very simple but efficient implementation, providing
   /// only four methods: join (union), find, insert and size.
-  /// For more features see the \ref UnionFindEnum class.
+  /// For more features, see the \ref UnionFindEnum class.
   ///
   /// It is primarily used in Kruskal algorithm for finding minimal

lemon/unionfind.h

@@ -1289 +1289 @@
         first_free_class(-1), first_free_node(-1) {}
 
+    /// \brief Clears the union-find data structure
+    ///
+    /// Erase each item from the data structure.
+    void clear() {
+      nodes.clear();
+      classes.clear();
+      first_free_node = first_free_class = first_class = -1;
+    }
+
     /// \brief Insert a new node into a new component.
     ///