COIN-OR::LEMON - Graph Library

Changeset 2428:c06e86364234 in lemon-0.x


Ignore:
Timestamp:
04/20/07 16:47:19 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3264
Message:

Doc change

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/kruskal.h

    r2424 r2428  
    6161  }
    6262
    63   /// \ingroup spantree
    64   ///
    6563  /// \brief Default traits class of Kruskal class.
    6664  ///
     
    108106  };
    109107
     108  ///\ingroup spantree
     109  ///
    110110  /// \brief Kruskal's algorithm to find a minimum cost tree of a graph.
    111111  ///
     
    299299    ///
    300300    /// This member function initializes the unionfind data structure
    301     /// and sets the edge order to the given sequence. The given
    302     /// sequence should be a valid STL range of undirected edges.
     301    /// and sets the tree to empty. It does not change the order of
     302    /// the edges, it uses the order of the previous running.
    303303    void reinit() {
    304304      initStructures();
Note: See TracChangeset for help on using the changeset viewer.