-
Notifications
You must be signed in to change notification settings - Fork 0
/
Heap.h
210 lines (170 loc) · 3.89 KB
/
Heap.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
/*
* Heap.h
*
* Created on: Apr 8, 2012
* Author: jason
*/
#include <iostream>
#include <cmath>
using namespace std;
#include "Node.h"
#ifndef HEAP_H_
#define HEAP_H_
#define MAX_SIZE 20
template <class T>
class Heap {
public:
Heap();
virtual ~Heap();
virtual void addNode(T *node) = 0;
int getSize() { return size; }
void print();
protected:
int size;
T* getNode(int i);
void heapify(int i);
static int left(int i);
static int right(int i);
static int parent(int i);
T** list;
};
template <class T>
class MinHeap : public Heap<T> {
public:
MinHeap();
~MinHeap();
public:
void decreaseKey(int i, T* node);
void addNode(T* node);
T* getMin();
};
template <class T>
class MaxHeap : public Heap<T> {
public:
MaxHeap();
~MaxHeap();
public:
void increaseKey(int i, T* node);
void addNode(T* node);
T* getMax();
};
template <class T>
Heap<T>::Heap() : size(0){
list = new T*[MAX_SIZE];
}
template <class T>
Heap<T>::~Heap() {
delete list;
// TODO Auto-generated destructor stub
}
template <class T>
void Heap<T>::print()
{
int depth = (int)log2(size);
for (int i = 0; i <= depth; i++) {
for (int x = 1; x <= (depth-i); x++)
cout << " ";
for (int j = 1; j <= pow(2, i); j++) {
//cout << "index: " << (j+(int)pow(2,i))-1 << endl;
int index = j+(int)pow(2,i)-1;
if (this->list[index] != NULL)
cout << *(this->list[index]->getValue()) << " ";
}
cout << endl;
}
// cout << this->list[i]->getValue() << " : " << ((this->list[Heap::parent(i)] != NULL) ? this->list[Heap::parent(i)]->getValue() : 0) << endl;
}
template <class T>
T* Heap<T>::getNode(int i) {
return list[i];
}
template <class T>
void Heap<T>::heapify(int i) {
int l = left(i);
int r = right(i);
int smallest = 0;
if (l <= this->size and *(list[l]->getValue()) < *(list[i]->getValue())) {
smallest = l;
} else
smallest = i;
if (r <= this->size and *(list[r]->getValue()) < *(list[smallest]->getValue())) {
smallest = r;
}
if (smallest != i) {
T* temp = list[i];
list[i] = list[smallest];
list[smallest] = temp;
heapify(smallest);
}
}
template <class T>
int Heap<T>::left(int i) {
return i*2;
}
template <class T>
int Heap<T>::right(int i) {
return i*2 +1;
}
template <class T>
int Heap<T>::parent(int i) {
return i / 2;
}
template <class T>
MinHeap<T>::MinHeap() { }
template <class T>
MinHeap<T>::~MinHeap() { }
template <class T>
void MinHeap<T>::decreaseKey(int i, T* node) {
if (node->getValue() && this->list[i] && this->list[i]->getValue() && *(node->getValue()) > *(this->list[i]->getValue())) {
return;
}
this->list[i] = node;
while (i > 1 && *(this->list[this->parent(i)]->getValue()) > *(this->list[i]->getValue())) {
T* temp = this->list[i];
this->list[i] = this->list[this->parent(i)];
this->list[this->parent(i)] = temp;
i = this->parent(i);
}
}
template <class T>
void MinHeap<T>::addNode(T* node) {
dprint("adding node to min heap", 4);
this->size++;
this->list[this->size] = new T();
decreaseKey(this->size, node);
}
template <class T>
T* MinHeap<T>::getMin() {
return this->list[1];
}
template <class T>
void MaxHeap<T>::increaseKey(int i, T* node) {
dprint("increase key", 4);
if (node->getValue() && this->list[i] && this->list[i]->getValue() && *(node->getValue()) < *(this->list[i]->getValue())) {
return;
}
dprint("move key", 4);
this->list[i] = node;
while (i > 1 && *(this->list[this->parent(i)]->getValue()) < *(this->list[i]->getValue())) {
T* temp = this->list[i];
this->list[i] = this->list[this->parent(i)];
this->list[this->parent(i)] = temp;
i = this->parent(i);
}
}
template <class T>
void MaxHeap<T>::addNode(T* node) {
dprint("adding node to max heap", 4);
this->size++;
this->list[this->size] = new T();
increaseKey(this->size, node);
}
template <class T>
T* MaxHeap<T>::getMax() {
return this->list[1];
}
template <class T>
MaxHeap<T>::MaxHeap() { }
template <class T>
MaxHeap<T>::~MaxHeap() { }
#endif /* HEAP_H_ */