lemon/kruskal.h
changeset 2083 f50c8c191cbd
parent 1979 c2992fd74dad
child 2084 59769591eb60
equal deleted inserted replaced
14:4f0593bfbbe0 15:ec8f231c283a
    20 #define LEMON_KRUSKAL_H
    20 #define LEMON_KRUSKAL_H
    21 
    21 
    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/utility.h>
    25 #include <lemon/bits/utility.h>
    26 #include <lemon/traits.h>
    26 #include <lemon/bits/traits.h>
    27 
    27 
    28 /**
    28 /**
    29 @defgroup spantree Minimum Cost Spanning Tree Algorithms
    29 @defgroup spantree Minimum Cost Spanning Tree Algorithms
    30 @ingroup galgs
    30 @ingroup galgs
    31 \brief This group containes the algorithms for finding a minimum cost spanning
    31 \brief This group containes the algorithms for finding a minimum cost spanning