0
2
0
... | ... |
@@ -223,14 +223,14 @@ |
223 | 223 |
|
224 | 224 |
// PairingHeap |
225 |
// { |
|
226 |
// typedef PairingHeap<Prio, ItemIntMap> IntHeap; |
|
227 |
// checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
|
228 |
// heapSortTest<IntHeap>(); |
|
229 |
// heapIncreaseTest<IntHeap>(); |
|
230 |
// |
|
231 |
// typedef PairingHeap<Prio, IntNodeMap > NodeHeap; |
|
232 |
// checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
|
233 |
// dijkstraHeapTest<NodeHeap>(digraph, length, source); |
|
234 |
// } |
|
225 |
{ |
|
226 |
typedef PairingHeap<Prio, ItemIntMap> IntHeap; |
|
227 |
checkConcept<Heap<Prio, ItemIntMap>, IntHeap>(); |
|
228 |
heapSortTest<IntHeap>(); |
|
229 |
heapIncreaseTest<IntHeap>(); |
|
230 |
|
|
231 |
typedef PairingHeap<Prio, IntNodeMap > NodeHeap; |
|
232 |
checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>(); |
|
233 |
dijkstraHeapTest<NodeHeap>(digraph, length, source); |
|
234 |
} |
|
235 | 235 |
|
236 | 236 |
// RadixHeap |
0 comments (0 inline)