lemon-0.x: test/heap_test.h@272fa8a0b680

     1 // -*- c++ -*-

     3 #include <vector>

     4 #include <algorithm>

     6 #include <lemon/dijkstra.h>

     8 class IntIntMap : public std::vector<int> {

     9 public:

    10   typedef std::vector<int> Parent;

    12   IntIntMap() : Parent() {}

    13   IntIntMap(int n) : Parent(n) {}

    14   IntIntMap(int n, int v) : Parent(n, v) {}

    16   void set(int key, int value) {

    17     Parent::operator[](key) = value;

    18   }

    19 };

    22 template <typename _Heap>

    23 void heapSortTest(int n) {

    24   typedef _Heap Heap;

    25   IntIntMap map(n, -1);

    27   Heap heap(map);

    29   std::vector<int> v(n);

    31   for (int i = 0; i < n; ++i) {

    32     v[i] = rand() % 1000;

    33     heap.push(i, v[i]);

    34   }

    35   std::sort(v.begin(), v.end());

    36   for (int i = 0; i < n; ++i) {

    37     check(v[i] == heap.prio() ,"Wrong order in heap sort.");

    38     heap.pop();

    39   }

    40 }

    42 template <typename _Heap>

    43 void heapIncreaseTest(int n) {

    44   typedef _Heap Heap;

    45   IntIntMap map(n, -1);

    47   Heap heap(map);

    49   std::vector<int> v(n);

    51   for (int i = 0; i < n; ++i) {

    52     v[i] = rand() % 1000;

    53     heap.push(i, v[i]);

    54   }

    55   for (int i = 0; i < n; ++i) {

    56     v[i] += rand() % 1000;

    57     heap.increase(i, v[i]);

    58   }

    59   std::sort(v.begin(), v.end());

    60   for (int i = 0; i < n; ++i) {

    61     check(v[i] == heap.prio() ,"Wrong order in heap increase test.");

    62     heap.pop();

    63   }

    64 }

    68 template <typename _Graph, typename _LengthMap, typename _Heap>

    69 void dijkstraHeapTest(_Graph& graph, _LengthMap& length,

    70 		      typename _Graph::Node& start) {

    72   typedef _Heap Heap;

    73   typedef _Graph Graph;

    74   typedef _LengthMap LengthMap;

    76   typedef typename Graph::Node Node;

    77   typedef typename Graph::Edge Edge;

    78   typedef typename Graph::NodeIt NodeIt;

    79   typedef typename Graph::EdgeIt EdgeIt;

    81   typename Dijkstra<Graph, LengthMap>::template DefStandardHeap<Heap>::

    82     Create dijkstra(graph, length);

    84   dijkstra.run(start);

    86   for(EdgeIt e(graph); e!=INVALID; ++e) {

    87     Node u=graph.source(e);

    88     Node v=graph.target(e);

    89     if (dijkstra.reached(u)) {

    90       check( dijkstra.dist(v) - dijkstra.dist(u) <= length[e],

    91       	     "Error in a shortest path tree edge!");

    92     }

    93   }

    95   for(NodeIt v(graph); v!=INVALID; ++v) {

    96     if ( dijkstra.reached(v) && dijkstra.predEdge(v) != INVALID ) {

    97       Edge e=dijkstra.predEdge(v);

    98       Node u=graph.source(e);

    99       check( dijkstra.dist(v) - dijkstra .dist(u) == length[e],

   100 	     "Error in a shortest path tree edge!");

   101     }

   102   }

   104 }

author	deba
	Tue, 31 Jan 2006 20:14:52 +0000
changeset 1934	272fa8a0b680
parent 1745	d356e54bdafc
child 1956	a055123339d5
permissions	-rw-r--r--