1.1 --- a/lemon/min_cut.h Thu Oct 26 13:35:35 2006 +0000
1.2 +++ b/lemon/min_cut.h Thu Oct 26 14:20:17 2006 +0000
1.3 @@ -38,17 +38,17 @@
1.4
1.5 template <typename CapacityMap>
1.6 struct HeapSelector {
1.7 - template <typename Key, typename Value, typename Ref>
1.8 + template <typename Value, typename Ref>
1.9 struct Selector {
1.10 - typedef BinHeap<Key, Value, Ref, std::greater<Value> > Heap;
1.11 + typedef BinHeap<Value, Ref, std::greater<Value> > Heap;
1.12 };
1.13 };
1.14
1.15 template <typename CapacityKey>
1.16 struct HeapSelector<ConstMap<CapacityKey, Const<int, 1> > > {
1.17 - template <typename Key, typename Value, typename Ref>
1.18 + template <typename Value, typename Ref>
1.19 struct Selector {
1.20 - typedef BucketHeap<Key, Ref, false > Heap;
1.21 + typedef BucketHeap<Ref, false > Heap;
1.22 };
1.23 };
1.24
1.25 @@ -99,7 +99,7 @@
1.26 /// \sa MaxCardinalitySearch
1.27 typedef typename _min_cut_bits
1.28 ::HeapSelector<CapacityMap>
1.29 - ::template Selector<typename Graph::Node, Value, HeapCrossRef>
1.30 + ::template Selector<Value, HeapCrossRef>
1.31 ::Heap Heap;
1.32
1.33 /// \brief Instantiates a Heap.
1.34 @@ -766,7 +766,7 @@
1.35 /// \sa MinCut
1.36 typedef typename _min_cut_bits
1.37 ::HeapSelector<CapacityMap>
1.38 - ::template Selector<typename AuxGraph::Node, Value, HeapCrossRef>
1.39 + ::template Selector<Value, HeapCrossRef>
1.40 ::Heap Heap;
1.41
1.42 /// \brief Instantiates a Heap.