lemon-0.x: comparison src/hugo/unionfind.h

equal deleted inserted replaced

-:f360f9aefd3d
+:fe6f7fe16afa
 /**
 * \brief A \e Union-Find data structure implementation
 *
 * 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.
 *
 * \pre The elements are automatically added only if the map
 /**
 * \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.
 */