Changeset 758:49b1a30c4dc4 in lemon-0.x for src/work
- Timestamp:
- 08/05/04 13:38:26 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1018
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/johanna/kruskal.h
r755 r758 6 6 #include <hugo/unionfind.h> 7 7 8 /** 9 @defgroup spantree Minimum Cost Spanning Tree Algorithms 10 \brief This group containes the algorithms for finding a minimum cost spanning 11 tree in a graph 12 @ingroup galgs 13 */ 14 15 ///\ingroup spantree 8 16 ///\file 9 17 ///\brief Kruskal's algorithm to compute a minimum cost tree 10 18 11 19 namespace hugo { 20 21 /// \addtogroup spantree 22 /// @{ 12 23 13 24 /// Kruskal's algorithm to find a minimum cost tree of a graph. … … 294 305 } 295 306 307 /// @} 296 308 297 309 } //namespace hugo
Note: See TracChangeset
for help on using the changeset viewer.