1.1 --- a/test/heap_test.cc	Thu Aug 20 20:34:30 2009 +0200
     1.2 +++ b/test/heap_test.cc	Fri Feb 26 17:07:13 2010 +0100
     1.3 @@ -31,9 +31,6 @@
     1.4  #include <lemon/maps.h>
     1.5  
     1.6  #include <lemon/bin_heap.h>
     1.7 -#include <lemon/fib_heap.h>
     1.8 -#include <lemon/radix_heap.h>
     1.9 -#include <lemon/bucket_heap.h>
    1.10  
    1.11  #include "test_tools.h"
    1.12  
    1.13 @@ -186,39 +183,5 @@
    1.14      dijkstraHeapTest<NodeHeap>(digraph, length, source);
    1.15    }
    1.16  
    1.17 -  {
    1.18 -    typedef FibHeap<Prio, ItemIntMap> IntHeap;
    1.19 -    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
    1.20 -    heapSortTest<IntHeap>();
    1.21 -    heapIncreaseTest<IntHeap>();
    1.22 -
    1.23 -    typedef FibHeap<Prio, IntNodeMap > NodeHeap;
    1.24 -    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
    1.25 -    dijkstraHeapTest<NodeHeap>(digraph, length, source);
    1.26 -  }
    1.27 -
    1.28 -  {
    1.29 -    typedef RadixHeap<ItemIntMap> IntHeap;
    1.30 -    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
    1.31 -    heapSortTest<IntHeap>();
    1.32 -    heapIncreaseTest<IntHeap>();
    1.33 -
    1.34 -    typedef RadixHeap<IntNodeMap > NodeHeap;
    1.35 -    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
    1.36 -    dijkstraHeapTest<NodeHeap>(digraph, length, source);
    1.37 -  }
    1.38 -
    1.39 -  {
    1.40 -    typedef BucketHeap<ItemIntMap> IntHeap;
    1.41 -    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
    1.42 -    heapSortTest<IntHeap>();
    1.43 -    heapIncreaseTest<IntHeap>();
    1.44 -
    1.45 -    typedef BucketHeap<IntNodeMap > NodeHeap;
    1.46 -    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
    1.47 -    dijkstraHeapTest<NodeHeap>(digraph, length, source);
    1.48 -  }
    1.49 -
    1.50 -
    1.51    return 0;
    1.52  }