Changes in lemon/kruskal.h [220:a5d8c039f218:216:6d7bfcf5b48e] in lemon-1.0

File:

• lemon/kruskal.h (modified) (2 diffs)

lemon/kruskal.h

@@ -23 +23 @@
 #include <vector>
 #include <lemon/unionfind.h>
+// #include <lemon/graph_utils.h>
 #include <lemon/maps.h>
 
-#include <lemon/core.h>
+// #include <lemon/radix_sort.h>
+
+#include <lemon/bits/utility.h>
 #include <lemon/bits/traits.h>
 
@@ -298 +301 @@
   /// \return The total cost of the found spanning tree.
   ///
-  /// \note If the input graph is not (weakly) connected, a spanning
+  /// \note If the input graph is not (weakly) connected, a spanning 
   /// forest is calculated instead of a spanning tree.