1.1 --- a/lemon/unionfind.h	Thu Dec 10 17:05:35 2009 +0100
     1.2 +++ b/lemon/unionfind.h	Thu Dec 10 17:18:25 2009 +0100
     1.3 @@ -43,7 +43,7 @@
     1.4    /// the find operation uses path compression.
     1.5    /// This is a very simple but efficient implementation, providing
     1.6    /// only four methods: join (union), find, insert and size.
     1.7 -  /// For more features see the \ref UnionFindEnum class.
     1.8 +  /// For more features, see the \ref UnionFindEnum class.
     1.9    ///
    1.10    /// It is primarily used in Kruskal algorithm for finding minimal
    1.11    /// cost spanning tree in a graph.
    1.12 @@ -739,7 +739,7 @@
    1.13      /// Erase each item from the data structure.
    1.14      void clear() {
    1.15        items.clear();
    1.16 -      classes.clear;
    1.17 +      classes.clear();
    1.18        firstClass = firstFreeClass = firstFreeItem = -1;
    1.19      }
    1.20