equal
deleted
inserted
replaced
22 #include <algorithm> |
22 #include <algorithm> |
23 #include <vector> |
23 #include <vector> |
24 #include <lemon/unionfind.h> |
24 #include <lemon/unionfind.h> |
25 #include <lemon/bits/utility.h> |
25 #include <lemon/bits/utility.h> |
26 #include <lemon/bits/traits.h> |
26 #include <lemon/bits/traits.h> |
27 |
|
28 /** |
|
29 @defgroup spantree Minimum Cost Spanning Tree Algorithms |
|
30 @ingroup galgs |
|
31 \brief This group containes the algorithms for finding a minimum cost spanning |
|
32 tree in a graph |
|
33 |
|
34 This group containes the algorithms for finding a minimum cost spanning |
|
35 tree in a graph |
|
36 */ |
|
37 |
27 |
38 ///\ingroup spantree |
28 ///\ingroup spantree |
39 ///\file |
29 ///\file |
40 ///\brief Kruskal's algorithm to compute a minimum cost tree |
30 ///\brief Kruskal's algorithm to compute a minimum cost tree |
41 /// |
31 /// |