1.1 --- a/lemon/kruskal.h	Mon Jul 14 15:40:24 2008 +0100
     1.2 +++ b/lemon/kruskal.h	Tue Jul 15 13:15:39 2008 +0200
     1.3 @@ -22,12 +22,9 @@
     1.4  #include <algorithm>
     1.5  #include <vector>
     1.6  #include <lemon/unionfind.h>
     1.7 -// #include <lemon/graph_utils.h>
     1.8  #include <lemon/maps.h>
     1.9  
    1.10 -// #include <lemon/radix_sort.h>
    1.11 -
    1.12 -#include <lemon/bits/utility.h>
    1.13 +#include <lemon/core.h>
    1.14  #include <lemon/bits/traits.h>
    1.15  
    1.16  ///\ingroup spantree
    1.17 @@ -300,7 +297,7 @@
    1.18    ///
    1.19    /// \return The total cost of the found spanning tree.
    1.20    ///
    1.21 -  /// \note If the input graph is not (weakly) connected, a spanning 
    1.22 +  /// \note If the input graph is not (weakly) connected, a spanning
    1.23    /// forest is calculated instead of a spanning tree.
    1.24  
    1.25  #ifdef DOXYGEN