test/heap_test.cc
changeset 980 48e17328c155
parent 855 65a0521e744e
child 1092 dceba191c00d
equal deleted inserted replaced
11:c664b7baced3 12:1fd0c657c270
   270 
   270 
   271     typedef SimpleBucketHeap<ItemIntMap> SimpleIntHeap;
   271     typedef SimpleBucketHeap<ItemIntMap> SimpleIntHeap;
   272     heapSortTest<SimpleIntHeap>();
   272     heapSortTest<SimpleIntHeap>();
   273   }
   273   }
   274 
   274 
       
   275   {
       
   276     typedef FibHeap<Prio, ItemIntMap> IntHeap;
       
   277     checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
       
   278     heapSortTest<IntHeap>();
       
   279     heapIncreaseTest<IntHeap>();
       
   280 
       
   281     typedef FibHeap<Prio, IntNodeMap > NodeHeap;
       
   282     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
       
   283     dijkstraHeapTest<NodeHeap>(digraph, length, source);
       
   284   }
       
   285 
       
   286   {
       
   287     typedef RadixHeap<ItemIntMap> IntHeap;
       
   288     checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
       
   289     heapSortTest<IntHeap>();
       
   290     heapIncreaseTest<IntHeap>();
       
   291 
       
   292     typedef RadixHeap<IntNodeMap > NodeHeap;
       
   293     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
       
   294     dijkstraHeapTest<NodeHeap>(digraph, length, source);
       
   295   }
       
   296 
       
   297   {
       
   298     typedef BucketHeap<ItemIntMap> IntHeap;
       
   299     checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
       
   300     heapSortTest<IntHeap>();
       
   301     heapIncreaseTest<IntHeap>();
       
   302 
       
   303     typedef BucketHeap<IntNodeMap > NodeHeap;
       
   304     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
       
   305     dijkstraHeapTest<NodeHeap>(digraph, length, source);
       
   306   }
       
   307 
       
   308 
   275   return 0;
   309   return 0;
   276 }
   310 }