COIN-OR::LEMON - Graph Library

Changeset 649:ce74706e924d in lemon-0.x


Ignore:
Timestamp:
05/20/04 11:42:31 (16 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@849
Message:

Cooorected some eroorrs.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/unionfind.h

    r542 r649  
    2525   * The class implements the \e Union-Find data structure.
    2626   * The union operation uses rank heuristic, while
    27    * the find operation uses path compresson.
     27   * the find operation uses path compression.
    2828   * This is a very simple but efficient implementation, providing
    2929   * only four methods: join (union), find, insert and size.
     
    189189   * is able to enumerate the components.
    190190   *
    191    * The class implements an \e Union-Find data structure
     191   * The class implements a \e Union-Find data structure
    192192   * which is able to enumerate the components and the items in
    193193   * a component. If you don't need this feature then perhaps it's
     
    195195   *
    196196   * The union operation uses rank heuristic, while
    197    * the find operation uses path compresson.
     197   * the find operation uses path compression.
    198198   *
    199199   * \pre You
Note: See TracChangeset for help on using the changeset viewer.