Changeset 2428:c06e86364234 in lemon-0.x
- Timestamp:
- 04/20/07 16:47:19 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3264
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/kruskal.h
r2424 r2428 61 61 } 62 62 63 /// \ingroup spantree64 ///65 63 /// \brief Default traits class of Kruskal class. 66 64 /// … … 108 106 }; 109 107 108 ///\ingroup spantree 109 /// 110 110 /// \brief Kruskal's algorithm to find a minimum cost tree of a graph. 111 111 /// … … 299 299 /// 300 300 /// This member function initializes the unionfind data structure 301 /// and sets the edge order to the given sequence. The given302 /// 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. 303 303 void reinit() { 304 304 initStructures();
Note: See TracChangeset
for help on using the changeset viewer.