COIN-OR::LEMON - Graph Library

Changeset 810:e9fbc747ca47 in lemon-0.x for src/hugo/unionfind.h


Ignore:
Timestamp:
09/06/04 19:12:00 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1105
Message:

Kruskal alg. (src/hugo/kruskal.h, src/test/kruskal_test.cc) is (almost) done.

  • Some input adaptor is still missing.
  • The class and function names should be revised.
  • Docs still needs some improvement.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/unionfind.h

    r774 r810  
    3333   * For more features see the \ref UnionFindEnum class.
    3434   *
     35   * It is primarily used in Kruskal algorithm for finding minimal
     36   * cost spanning tree in a graph.
     37   * \sa kruskal()
     38   *
    3539   * \pre The elements are automatically added only if the map
    3640   * given to the constructor was filled with -1's. Otherwise you
    3741   * need to add all the elements by the \ref insert() method.
     42   * \bug It is not clear what the constructor parameter is used for.
    3843   */
    3944
Note: See TracChangeset for help on using the changeset viewer.