1.1 --- a/lemon/min_cut.h	Tue Apr 04 17:43:23 2006 +0000
     1.2 +++ b/lemon/min_cut.h	Tue Apr 04 17:45:35 2006 +0000
     1.3 @@ -24,7 +24,7 @@
     1.4  
     1.5  #include <lemon/list_graph.h>
     1.6  #include <lemon/bin_heap.h>
     1.7 -#include <lemon/linear_heap.h>
     1.8 +#include <lemon/bucket_heap.h>
     1.9  
    1.10  #include <lemon/bits/invalid.h>
    1.11  #include <lemon/error.h>
    1.12 @@ -48,7 +48,7 @@
    1.13      struct HeapSelector<ConstMap<CapacityKey, Const<int, 1> > > {
    1.14        template <typename Key, typename Value, typename Ref>
    1.15        struct Selector {
    1.16 -        typedef LinearHeap<Key, Ref, false > Heap;
    1.17 +        typedef BucketHeap<Key, Ref, false > Heap;
    1.18        };
    1.19      };
    1.20  
    1.21 @@ -94,7 +94,7 @@
    1.22      /// maximalize the priorities. The default heap type is
    1.23      /// the \ref BinHeap, but it is specialized when the
    1.24      /// CapacityMap is ConstMap<Graph::Node, Const<int, 1> >
    1.25 -    /// to LinearHeap.
    1.26 +    /// to BucketHeap.
    1.27      ///
    1.28      /// \sa MaxCardinalitySearch
    1.29      typedef typename _min_cut_bits
    1.30 @@ -841,7 +841,7 @@
    1.31    ///
    1.32    /// The complexity of the algorithm is O(n*e*log(n)) but with Fibonacci 
    1.33    /// heap it can be decreased to O(n*e+n^2*log(n)). When the neutral capacity 
    1.34 -  /// map is used then it uses LinearHeap which results O(n*e) time complexity.
    1.35 +  /// map is used then it uses BucketHeap which results O(n*e) time complexity.
    1.36  #ifdef DOXYGEN
    1.37    template <typename _Graph, typename _CapacityMap, typename _Traits>
    1.38  #else