diff -r 32e4bebee616 -r 33db14058543 lemon/min_cut.h
--- a/lemon/min_cut.h	Tue Apr 04 17:43:23 2006 +0000
+++ b/lemon/min_cut.h	Tue Apr 04 17:45:35 2006 +0000
@@ -24,7 +24,7 @@
 
 #include <lemon/list_graph.h>
 #include <lemon/bin_heap.h>
-#include <lemon/linear_heap.h>
+#include <lemon/bucket_heap.h>
 
 #include <lemon/bits/invalid.h>
 #include <lemon/error.h>
@@ -48,7 +48,7 @@
     struct HeapSelector<ConstMap<CapacityKey, Const<int, 1> > > {
       template <typename Key, typename Value, typename Ref>
       struct Selector {
-        typedef LinearHeap<Key, Ref, false > Heap;
+        typedef BucketHeap<Key, Ref, false > Heap;
       };
     };
 
@@ -94,7 +94,7 @@
     /// maximalize the priorities. The default heap type is
     /// the \ref BinHeap, but it is specialized when the
     /// CapacityMap is ConstMap<Graph::Node, Const<int, 1> >
-    /// to LinearHeap.
+    /// to BucketHeap.
     ///
     /// \sa MaxCardinalitySearch
     typedef typename _min_cut_bits
@@ -841,7 +841,7 @@
   ///
   /// The complexity of the algorithm is O(n*e*log(n)) but with Fibonacci 
   /// heap it can be decreased to O(n*e+n^2*log(n)). When the neutral capacity 
-  /// map is used then it uses LinearHeap which results O(n*e) time complexity.
+  /// map is used then it uses BucketHeap which results O(n*e) time complexity.
 #ifdef DOXYGEN
   template <typename _Graph, typename _CapacityMap, typename _Traits>
 #else