Changeset 1728:eb8bb91ba9e2 in lemon0.x for test/heap_test.cc
 Timestamp:
 10/14/05 13:03:40 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2255
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

test/heap_test.cc
r1435 r1728 16 16 #include <lemon/fib_heap.h> 17 17 #include <lemon/radix_heap.h> 18 #include <lemon/linear_heap.h> 18 19 19 20 #include "test_tools.h" … … 21 22 #include "heap_test.h" 22 23 24 #include <lemon/time_measure.h> 23 25 24 26 using namespace lemon; … … 66 68 typedef FibHeap<Node, Prio, Graph::NodeMap<int> > NodeHeap; 67 69 checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>(); 70 Timer timer; 68 71 dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start); 72 std::cout << timer << std::endl; 69 73 } 70 74 { … … 78 82 typedef FibHeap<Node, Prio, Graph::NodeMap<int> > NodeHeap; 79 83 checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>(); 84 Timer timer; 80 85 dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start); 86 std::cout << timer << std::endl; 81 87 } 82 88 { … … 90 96 typedef RadixHeap<Node, Graph::NodeMap<int> > NodeHeap; 91 97 checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>(); 98 Timer timer; 92 99 dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start); 100 std::cout << timer << std::endl; 101 } 102 103 { 104 std::cerr << "Checking Linear Heap" << std::endl; 105 106 typedef LinearHeap<Item, ItemIntMap> IntHeap; 107 checkConcept<Heap<Item, Prio, ItemIntMap>, IntHeap>(); 108 heapSortTest<IntHeap>(100); 109 heapIncreaseTest<IntHeap>(100); 110 111 typedef LinearHeap<Node, Graph::NodeMap<int> > NodeHeap; 112 checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>(); 113 Timer timer; 114 dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start); 115 std::cout << timer << std::endl; 93 116 } 94 117
Note: See TracChangeset
for help on using the changeset viewer.