# HG changeset patch
# User athos
# Date 1085046151 0
# Node ID ce74706e924dad614bfcbd033bfe6de8beb14024
# Parent  8c13444bccf6598b8cc24827e9bfa0d83a2f93e6
Cooorected some eroorrs.

diff -r 8c13444bccf6 -r ce74706e924d src/hugo/unionfind.h
--- a/src/hugo/unionfind.h	Wed May 19 16:20:10 2004 +0000
+++ b/src/hugo/unionfind.h	Thu May 20 09:42:31 2004 +0000
@@ -24,7 +24,7 @@
    *
    * The class implements the \e Union-Find data structure. 
    * The union operation uses rank heuristic, while
-   * the find operation uses path compresson.
+   * 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.
@@ -188,13 +188,13 @@
    * \brief A \e Union-Find data structure implementation which
    * is able to enumerate the components.
    *
-   * The class implements an \e Union-Find data structure
+   * The class implements a \e Union-Find data structure
    * which is able to enumerate the components and the items in
    * a component. If you don't need this feature then perhaps it's
    * better to use the \ref UnionFind class which is more efficient.
    *
    * The union operation uses rank heuristic, while
-   * the find operation uses path compresson.
+   * the find operation uses path compression.
    *
    * \pre You
    * need to add all the elements by the \ref insert() method.