1.1 --- a/src/hugo/unionfind.h	Wed May 19 16:20:10 2004 +0000
     1.2 +++ b/src/hugo/unionfind.h	Thu May 20 09:42:31 2004 +0000
     1.3 @@ -24,7 +24,7 @@
     1.4     *
     1.5     * The class implements the \e Union-Find data structure. 
     1.6     * The union operation uses rank heuristic, while
     1.7 -   * the find operation uses path compresson.
     1.8 +   * the find operation uses path compression.
     1.9     * This is a very simple but efficient implementation, providing 
    1.10     * only four methods: join (union), find, insert and size.
    1.11     * For more features see the \ref UnionFindEnum class.
    1.12 @@ -188,13 +188,13 @@
    1.13     * \brief A \e Union-Find data structure implementation which
    1.14     * is able to enumerate the components.
    1.15     *
    1.16 -   * The class implements an \e Union-Find data structure
    1.17 +   * The class implements a \e Union-Find data structure
    1.18     * which is able to enumerate the components and the items in
    1.19     * a component. If you don't need this feature then perhaps it's
    1.20     * better to use the \ref UnionFind class which is more efficient.
    1.21     *
    1.22     * The union operation uses rank heuristic, while
    1.23 -   * the find operation uses path compresson.
    1.24 +   * the find operation uses path compression.
    1.25     *
    1.26     * \pre You
    1.27     * need to add all the elements by the \ref insert() method.