COIN-OR::LEMON - Graph Library

Changeset 875:07ec2b52e53d in lemon-1.2 for lemon/unionfind.h


Ignore:
Timestamp:
03/17/10 10:29:57 (10 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Parents:
874:d8ea85825e02 (diff), 867:5b926cc36a4b (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge #356

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • lemon/unionfind.h

    r867 r875  
    4444  /// This is a very simple but efficient implementation, providing
    4545  /// only four methods: join (union), find, insert and size.
    46   /// For more features see the \ref UnionFindEnum class.
     46  /// For more features, see the \ref UnionFindEnum class.
    4747  ///
    4848  /// It is primarily used in Kruskal algorithm for finding minimal
  • lemon/unionfind.h

    r800 r875  
    12891289        first_free_class(-1), first_free_node(-1) {}
    12901290
     1291    /// \brief Clears the union-find data structure
     1292    ///
     1293    /// Erase each item from the data structure.
     1294    void clear() {
     1295      nodes.clear();
     1296      classes.clear();
     1297      first_free_node = first_free_class = first_class = -1;
     1298    }
     1299
    12911300    /// \brief Insert a new node into a new component.
    12921301    ///
Note: See TracChangeset for help on using the changeset viewer.