COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/heap_test.h @ 2553:bfced05fa852

Last change on this file since 2553:bfced05fa852 was 2553:bfced05fa852, checked in by Alpar Juttner, 12 years ago

Happy New Year to LEMON (+ better update-copyright-header script)

File size: 2.9 KB
Line 
1/* -*- C++ -*-
2 *
3 * This file is a part of LEMON, a generic C++ optimization library
4 *
5 * Copyright (C) 2003-2008
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
8 *
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
12 *
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
15 * purpose.
16 *
17 */
18
19#include <vector>
20#include <algorithm>
21
22#include <lemon/dijkstra.h>
23
24class IntIntMap : public std::vector<int> {
25public:
26  typedef std::vector<int> Parent;
27
28  typedef int Key;
29  typedef int Value;
30
31  IntIntMap() : Parent() {}
32  IntIntMap(int n) : Parent(n) {}
33  IntIntMap(int n, int v) : Parent(n, v) {}
34
35  void set(int key, int value) {
36    Parent::operator[](key) = value;
37  }
38};
39
40
41template <typename _Heap>
42void heapSortTest(int n) {
43  typedef _Heap Heap;
44  IntIntMap map(n, -1);
45
46  Heap heap(map);
47 
48  std::vector<int> v(n);
49
50  for (int i = 0; i < n; ++i) {
51    v[i] = rnd[1000];
52    heap.push(i, v[i]);
53  }
54  std::sort(v.begin(), v.end());
55  for (int i = 0; i < n; ++i) {
56    check(v[i] == heap.prio() ,"Wrong order in heap sort.");
57    heap.pop();
58  }
59}
60
61template <typename _Heap>
62void heapIncreaseTest(int n) {
63  typedef _Heap Heap;
64  IntIntMap map(n, -1);
65
66  Heap heap(map);
67 
68  std::vector<int> v(n);
69
70  for (int i = 0; i < n; ++i) {
71    v[i] = rnd[1000];
72    heap.push(i, v[i]);
73  }
74  for (int i = 0; i < n; ++i) {
75    v[i] += rnd[1000];
76    heap.increase(i, v[i]);
77  }
78  std::sort(v.begin(), v.end());
79  for (int i = 0; i < n; ++i) {
80    check(v[i] == heap.prio() ,"Wrong order in heap increase test.");
81    heap.pop();
82  }
83}
84
85
86
87template <typename _Graph, typename _LengthMap, typename _Heap>
88void dijkstraHeapTest(_Graph& graph, _LengthMap& length,
89                      typename _Graph::Node& start) {
90
91  typedef _Heap Heap;
92  typedef _Graph Graph;
93  typedef _LengthMap LengthMap;
94
95  typedef typename Graph::Node Node;
96  typedef typename Graph::Edge Edge;
97  typedef typename Graph::NodeIt NodeIt;
98  typedef typename Graph::EdgeIt EdgeIt;
99
100  typename Dijkstra<Graph, LengthMap>::template DefStandardHeap<Heap>::
101    Create dijkstra(graph, length);
102
103  dijkstra.run(start);
104
105  for(EdgeIt e(graph); e!=INVALID; ++e) {
106    Node u=graph.source(e);
107    Node v=graph.target(e);
108    if (dijkstra.reached(u)) {
109      check( dijkstra.dist(v) - dijkstra.dist(u) <= length[e],
110             "Error in a shortest path tree edge!");
111    }
112  }
113
114  for(NodeIt v(graph); v!=INVALID; ++v) {
115    if ( dijkstra.reached(v) && dijkstra.predEdge(v) != INVALID ) {
116      Edge e=dijkstra.predEdge(v);
117      Node u=graph.source(e);
118      check( dijkstra.dist(v) - dijkstra .dist(u) == length[e],
119             "Error in a shortest path tree edge!");
120    }
121  }
122
123}
Note: See TracBrowser for help on using the repository browser.