Index: src/hugo/unionfind.h
===================================================================
--- src/hugo/unionfind.h	(revision 542)
+++ src/hugo/unionfind.h	(revision 649)
@@ -25,5 +25,5 @@
    * 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.
@@ -189,5 +189,5 @@
    * 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
@@ -195,5 +195,5 @@
    *
    * The union operation uses rank heuristic, while
-   * the find operation uses path compresson.
+   * the find operation uses path compression.
    *
    * \pre You