1.1 --- a/src/hugo/unionfind.h	Mon Sep 06 13:47:54 2004 +0000
     1.2 +++ b/src/hugo/unionfind.h	Mon Sep 06 17:12:00 2004 +0000
     1.3 @@ -32,9 +32,14 @@
     1.4     * only four methods: join (union), find, insert and size.
     1.5     * For more features see the \ref UnionFindEnum class.
     1.6     *
     1.7 +   * It is primarily used in Kruskal algorithm for finding minimal
     1.8 +   * cost spanning tree in a graph.
     1.9 +   * \sa kruskal()
    1.10 +   *
    1.11     * \pre The elements are automatically added only if the map 
    1.12     * given to the constructor was filled with -1's. Otherwise you
    1.13     * need to add all the elements by the \ref insert() method.
    1.14 +   * \bug It is not clear what the constructor parameter is used for.
    1.15     */
    1.16  
    1.17    template <typename T, typename TIntMap>