* @file
* @brief Union-Find datastructure
* @author Matthias Braun
- * @version $Id$
- * @brief
- * Union-Find datastructure
- *
- * This implementation uses weighted sets and path compression which results
- * in (nearly) O(n) complexity for n find and union operations
*/
#ifndef FIRM_ADT_UNIONFIND_H
#define FIRM_ADT_UNIONFIND_H
#include "../begin.h"
+/**
+ * @ingroup adt
+ * @defgroup unionfind Union-Find
+ * Union-Find datastructure
+ *
+ * This implementation uses weighted sets and path compression which results
+ * in (nearly) O(n) complexity for n find and union operations
+ * @{
+ */
+
/**
* Call this to initialize an array of @p count elements to be used by the
* union find functions.
return repr;
}
+/** @} */
+
#include "../end.h"
#endif