diff -r 994c7df296c9 -r 1b89e29c9fc7 lemon/unionfind.h
--- a/lemon/unionfind.h	Thu Dec 10 17:05:35 2009 +0100
+++ b/lemon/unionfind.h	Thu Dec 10 17:18:25 2009 +0100
@@ -43,7 +43,7 @@
   /// the find operation uses path compression.
   /// 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
   /// cost spanning tree in a graph.
@@ -739,7 +739,7 @@
     /// Erase each item from the data structure.
     void clear() {
       items.clear();
-      classes.clear;
+      classes.clear();
       firstClass = firstFreeClass = firstFreeItem = -1;
     }