Changeset 220:a5d8c039f218 in lemon-1.2 for lemon/kruskal.h
- Timestamp:
- 07/15/08 13:15:39 (17 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/kruskal.h
r216 r220 23 23 #include <vector> 24 24 #include <lemon/unionfind.h> 25 // #include <lemon/graph_utils.h>26 25 #include <lemon/maps.h> 27 26 28 // #include <lemon/radix_sort.h> 29 30 #include <lemon/bits/utility.h> 27 #include <lemon/core.h> 31 28 #include <lemon/bits/traits.h> 32 29 … … 301 298 /// \return The total cost of the found spanning tree. 302 299 /// 303 /// \note If the input graph is not (weakly) connected, a spanning 300 /// \note If the input graph is not (weakly) connected, a spanning 304 301 /// forest is calculated instead of a spanning tree. 305 302
Note: See TracChangeset
for help on using the changeset viewer.