-
Notifications
You must be signed in to change notification settings - Fork 0
/
AIS_COMPARE_JONSON_LEFT_AND_SELFORG_HEAPS.cpp
409 lines (326 loc) · 14.8 KB
/
AIS_COMPARE_JONSON_LEFT_AND_SELFORG_HEAPS.cpp
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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
// AIS_COMPARE_JONSON_LEFT_AND_SELFORG_HEAPS.cpp : main project file.
#include <iostream>
#include <omp.h>
#include "Graph.h"
#include "Algorithms.h"
using namespace std;
// Àëãîðèòì Äæîíñîíà ñ èñïîëüçîâàíèåì àëãîðèòìà Äåéêñòðû íà ëåâîñòîðîííåé êó÷å
void Djonson_LeftHeap(int** dist, Graph ADJ, int num_vert)
{
Graph AdditionalGraph = ADJ;
AdditionalGraph.AddVertex(ADJ.GetNumOfVertex() + 1);
int* dist_Bellman_Ford = new int[AdditionalGraph.GetNumOfVertex()];// Îí áóäåò ñîäåðæàòü çíà÷åíèÿ íå áîëüøå íóëÿ
for(int i = 0; i < AdditionalGraph.GetNumOfVertex() - 1; i++)
AdditionalGraph.AddEdge(AdditionalGraph.GetNumOfVertex() - 1, i, 0);
// Ïðèìåíÿåì Áåëëìàíà-Ôîðäà äëÿ ãðàôà ñ íàëè÷èåì îòðèöàòåëüíûõ âåñîâ ðåáåð
if(Bellman_Ford(dist_Bellman_Ford, AdditionalGraph, AdditionalGraph.GetNumOfVertex(), AdditionalGraph.GetNumOfVertex() - 1))
{
for(ADJ.Reset(); !ADJ.IsEnd(); ADJ.GoNext())// Äåëàåì íåîòðèöàòåëüíûå âåñà äëÿ àëãîðèòìà Äåéêñòðû
{
ADJ.SetWeightOfEdge(ADJ.GetCurrVertex(),
ADJ.GetCurrEdge().vertB,
ADJ.GetCurrEdge().weight + dist_Bellman_Ford[ADJ.GetCurrVertex()] - dist_Bellman_Ford[ADJ.GetCurrEdge().vertB]);
}
for(int i = 0; i < ADJ.GetNumOfVertex(); i++)
{
Dijkstra_LeftHeap(dist[i], ADJ, ADJ.GetNumOfVertex(), i);
for(int j = 0; j < ADJ.GetNumOfVertex(); j++)
dist[i][j] = dist[i][j] + dist_Bellman_Ford[j] - dist_Bellman_Ford[i];
}
for(ADJ.Reset(); !ADJ.IsEnd(); ADJ.GoNext())// Îáðàòíî ìåíÿåì âåñà íà ïðåäûäóùèå ó ãðàôà ADJ
{
ADJ.SetWeightOfEdge(ADJ.GetCurrVertex(),
ADJ.GetCurrEdge().vertB,
ADJ.GetCurrEdge().weight + dist_Bellman_Ford[ADJ.GetCurrEdge().vertB ] - dist_Bellman_Ford[ADJ.GetCurrVertex()]);
}
}
else
cout << "Graph contains a cycle of negative weight" << endl;
}
// Àëãîðèòì Äæîíñîíà ñ èñïîëüçîâàíèåì àëãîðèòìà Äåéêñòðû íà d-êó÷å (d = 2)
void Djonson_DHeap(int** dist, Graph ADJ, int num_vert, int _d)
{
Graph AdditionalGraph = ADJ;
AdditionalGraph.AddVertex(ADJ.GetNumOfVertex() + 1);
int* dist_Bellman_Ford = new int[AdditionalGraph.GetNumOfVertex()];// Îí áóäåò ñîäåðæàòü çíà÷åíèÿ íå áîëüøå íóëÿ
for(int i = 0; i < AdditionalGraph.GetNumOfVertex() - 1; i++)
AdditionalGraph.AddEdge(AdditionalGraph.GetNumOfVertex() - 1, i, 0);
// Ïðèìåíÿåì Áåëëìàíà-Ôîðäà äëÿ ãðàôà ñ íàëè÷èåì îòðèöàòåëüíûõ âåñîâ ðåáåð
if(Bellman_Ford(dist_Bellman_Ford, AdditionalGraph, AdditionalGraph.GetNumOfVertex(), AdditionalGraph.GetNumOfVertex() - 1))
{
for(ADJ.Reset(); !ADJ.IsEnd(); ADJ.GoNext())// Äåëàåì íåîòðèöàòåëüíûå âåñà äëÿ àëãîðèòìà Äåéêñòðû
{
ADJ.SetWeightOfEdge(ADJ.GetCurrVertex(),
ADJ.GetCurrEdge().vertB,
ADJ.GetCurrEdge().weight + dist_Bellman_Ford[ADJ.GetCurrVertex()] - dist_Bellman_Ford[ADJ.GetCurrEdge().vertB]);
}
for(int i = 0; i < ADJ.GetNumOfVertex(); i++)
{
Dijkstra_DHeap(dist[i], ADJ, ADJ.GetNumOfVertex(), i, _d);
for(int j = 0; j < ADJ.GetNumOfVertex(); j++)
dist[i][j] = dist[i][j] + dist_Bellman_Ford[j] - dist_Bellman_Ford[i];
}
for(ADJ.Reset(); !ADJ.IsEnd(); ADJ.GoNext())// Îáðàòíî ìåíÿåì âåñà íà ïðåäûäóùèå ó ãðàôà ADJ
{
ADJ.SetWeightOfEdge(ADJ.GetCurrVertex(),
ADJ.GetCurrEdge().vertB,
ADJ.GetCurrEdge().weight + dist_Bellman_Ford[ADJ.GetCurrEdge().vertB ] - dist_Bellman_Ford[ADJ.GetCurrVertex()]);
}
}
else
cout << "Graph contains a cycle of negative weight" << endl;
}
// Àëãîðèòì Äæîíñîíà ñ èñïîëüçîâàíèåì àëãîðèòìà Äåéêñòðû íà ñàìîîðãàíèçóþùåéñÿ êó÷å
void Djonson_SelfOrganizationHeap(int** dist, Graph ADJ, int num_vert)
{
Graph AdditionalGraph = ADJ;
AdditionalGraph.AddVertex(ADJ.GetNumOfVertex() + 1);
int* dist_Bellman_Ford = new int[AdditionalGraph.GetNumOfVertex()];// Îí áóäåò ñîäåðæàòü çíà÷åíèÿ íå áîëüøå íóëÿ
for(int i = 0; i < AdditionalGraph.GetNumOfVertex() - 1; i++)
AdditionalGraph.AddEdge(AdditionalGraph.GetNumOfVertex() - 1, i, 0);
// Ïðèìåíÿåì Áåëëìàíà-Ôîðäà äëÿ ãðàôà ñ íàëè÷èåì îòðèöàòåëüíûõ âåñîâ ðåáåð
if(Bellman_Ford(dist_Bellman_Ford, AdditionalGraph, AdditionalGraph.GetNumOfVertex(), AdditionalGraph.GetNumOfVertex() - 1))
{
for(ADJ.Reset(); !ADJ.IsEnd(); ADJ.GoNext())// Äåëàåì íåîòðèöàòåëüíûå âåñà äëÿ àëãîðèòìà Äåéêñòðû
{
ADJ.SetWeightOfEdge(ADJ.GetCurrVertex(),
ADJ.GetCurrEdge().vertB,
ADJ.GetCurrEdge().weight + dist_Bellman_Ford[ADJ.GetCurrVertex()] - dist_Bellman_Ford[ADJ.GetCurrEdge().vertB]);
}
for(int i = 0; i < ADJ.GetNumOfVertex(); i++)
{
Dijkstra_SelfOrganizationHeap(dist[i], ADJ, ADJ.GetNumOfVertex(), i);
for(int j = 0; j < ADJ.GetNumOfVertex(); j++)
dist[i][j] = dist[i][j] + dist_Bellman_Ford[j] - dist_Bellman_Ford[i];
}
for(ADJ.Reset(); !ADJ.IsEnd(); ADJ.GoNext())// Îáðàòíî ìåíÿåì âåñà íà ïðåäûäóùèå ó ãðàôà ADJ
{
ADJ.SetWeightOfEdge(ADJ.GetCurrVertex(),
ADJ.GetCurrEdge().vertB,
ADJ.GetCurrEdge().weight + dist_Bellman_Ford[ADJ.GetCurrEdge().vertB ] - dist_Bellman_Ford[ADJ.GetCurrVertex()]);
}
}
else
cout << "Graph contains a cycle of negative weight" << endl;
}
void main()
{
Graph test;
int num_of_vert, num_of_edge, low_lim_weight, up_lim_weight;
double work_time_DJ_LeftHeap = 0.0;
double start_time_DJ_LeftHeap = 0.0;
double end_time_DJ_LeftHeap = 0.0;
double work_time_DJ_DHeap = 0.0;
double start_time_DJ_DHeap = 0.0;
double end_time_DJ_DHeap = 0.0;
double work_time_DJ_SelforganizationHeap = 0.0;
double start_time_DJ_SelforganizationHeap = 0.0;
double end_time_DJ_SelforganizationHeap = 0.0;
bool Exit = false;
int Option;
while(!Exit)
{
cout << "Enter 1 to create a graph: " << endl;
cout << "Enter 2 to show a graph: " << endl;
cout << "Enter 3 to run the algorithm Johnson which uses Dijkstra's algorithm on the left heap: " << endl;
cout << "Enter 4 to run the algorithm Johnson which uses Dijkstra's algorithm on the d-heap: " << endl;
cout << "Enter 5 to run the algorithm Johnson which uses Dijkstra's algorithm on the selforganization heap: " << endl;
cout << "Enter 6 to run the experiments: " << endl;
cout << "Enter 7 to clear the output window: " << endl;
cout << "Enter 0 to close this program: " << endl;
cout << endl;
cin >> Option;
switch(Option)
{
case 1:
{
cout << "Input number of vertexs: " <<endl;
cin >> num_of_vert;
cout << "Input number of edges: " <<endl;
cin >> num_of_edge;
cout << "Input lower limit of weight: " <<endl;
cin >> low_lim_weight;
cout << "Input upper limit of weight: " <<endl;
cin >> up_lim_weight;
Graph test_1(num_of_vert, num_of_edge, low_lim_weight, up_lim_weight);
test = test_1;
break;
}
case 2:
{
if(!test.IsEmpty())
test.ShowGraph();
else
cout << "Graph is empty! " << endl;
cout << endl;
break;
}
case 3:
{
if(!test.IsEmpty())
{
int** table_of_dists;
int Show_table;
table_of_dists = new int*[test.GetNumOfVertex()];
for(int i = 0; i < test.GetNumOfVertex(); i++)
table_of_dists[i] = new int[test.GetNumOfVertex()];
start_time_DJ_LeftHeap = omp_get_wtime();
Djonson_LeftHeap(table_of_dists, test, test.GetNumOfVertex());
end_time_DJ_LeftHeap = omp_get_wtime();
work_time_DJ_LeftHeap = end_time_DJ_LeftHeap - start_time_DJ_LeftHeap;
cout << "Show table of shortest distances? (1 - yes, 0 - no)" << endl;
cin >> Show_table;
cout << endl;
if(Show_table)
{
for(int i = 0; i < test.GetNumOfVertex(); i++)
{
cout << i << ":";
for(int j = 0; j < test.GetNumOfVertex(); j++)
cout << " " <<table_of_dists[i][j];
cout << endl;
}
}
cout << endl;
// Âûäàòü âðåìÿ ðàáîòû
cout << "Algorithm of Djonson, which uses Dijkstra's algorithm on the left heap is worked: " << work_time_DJ_LeftHeap << "seconds" << endl;
cout << endl;
}
else
{
cout << "Graph is empty! " << endl;
cout << endl;
}
break;
}
case 4:
{
if(!test.IsEmpty())
{
int** table_of_dists;
int Show_table;
int _d;
table_of_dists = new int*[test.GetNumOfVertex()];
for(int i = 0; i < test.GetNumOfVertex(); i++)
table_of_dists[i] = new int[test.GetNumOfVertex()];
cout << "Input the value of d in d-heap:" << endl;
cin >> _d;
start_time_DJ_DHeap = omp_get_wtime();
Djonson_DHeap(table_of_dists, test, test.GetNumOfVertex(), _d);
end_time_DJ_DHeap = omp_get_wtime();
work_time_DJ_DHeap = end_time_DJ_DHeap - start_time_DJ_DHeap;
cout << "Show table of shortest distances? (1 - yes, 0 - no)" << endl;
cin >> Show_table;
cout << endl;
if(Show_table)
{
for(int i = 0; i < test.GetNumOfVertex(); i++)
{
cout << i << ":";
for(int j = 0; j < test.GetNumOfVertex(); j++)
cout << " " <<table_of_dists[i][j];
cout << endl;
}
}
cout << endl;
// Âûäàòü âðåìÿ ðàáîòû
cout << "Algorithm of Djonson, which uses Dijkstra's algorithm on the d-heap ( d = " << _d << ") is worked: " << work_time_DJ_DHeap << "seconds" << endl;
cout << endl;
}
else
{
cout << "Graph is empty! " << endl;
cout << endl;
}
break;
}
case 5:
{
if(!test.IsEmpty())
{
int** table_of_dists;
int Show_table;
table_of_dists = new int*[test.GetNumOfVertex()];
for(int i = 0; i < test.GetNumOfVertex(); i++)
table_of_dists[i] = new int[test.GetNumOfVertex()];
start_time_DJ_SelforganizationHeap = omp_get_wtime();
Djonson_SelfOrganizationHeap(table_of_dists, test, test.GetNumOfVertex());
end_time_DJ_SelforganizationHeap = omp_get_wtime();
work_time_DJ_SelforganizationHeap = end_time_DJ_SelforganizationHeap - start_time_DJ_SelforganizationHeap;
cout << "Show table of shortest distances? (1 - yes, 0 - no)" << endl;
cin >> Show_table;
cout << endl;
if(Show_table)
{
for(int i = 0; i < test.GetNumOfVertex(); i++)
{
cout << i << ":";
for(int j = 0; j < test.GetNumOfVertex(); j++)
cout << " " <<table_of_dists[i][j];
cout << endl;
}
}
cout << endl;
// Âûäàòü âðåìÿ ðàáîòû
cout << "Algorithm of Djonson, which uses Dijkstra's algorithm on the selforganization heap is worked: " << work_time_DJ_SelforganizationHeap << "seconds" << endl;
cout << endl;
}
else
{
cout << "Graph is empty! " << endl;
cout << endl;
}
break;
}
case 6:
{
double start_time = 0.0;
double end_time = 0.0;
double time_work = 0.0;
int n, m, min_weight = 1, max_weight = 1000000;
// Òåñòèðîâàíèå àëãîðèòìîâ ïðè èñïîëüçîâàíèè ïîëíîãî ãðàôà. Ó àëãîðèòìû Äåéêñòðû èñïîëüçóåòñÿ d = 2
for(int n = 1; n <= 501; n+=50)
{
int _d = 2;
int** dists;
dists = new int*[n];
for(int i = 0; i < n; i++)
dists[i] = new int[n];
if(n > 1)
m = (n - 1) * n;
else
m = 1;
Graph test_graph(n, m, min_weight, max_weight);
start_time = omp_get_wtime();
Djonson_LeftHeap(dists, test_graph, test_graph.GetNumOfVertex());
end_time = omp_get_wtime();
time_work = end_time - start_time;
cout << "LeftHeap: " << time_work << endl;
start_time = omp_get_wtime();
Djonson_DHeap(dists, test_graph, test_graph.GetNumOfVertex(), _d);
end_time = omp_get_wtime();
time_work = end_time - start_time;
cout << "DHeap: " << time_work << endl;
start_time = omp_get_wtime();
Djonson_SelfOrganizationHeap(dists, test_graph, test_graph.GetNumOfVertex());
end_time = omp_get_wtime();
time_work = end_time - start_time;
cout << "SelfOrganizationHeap: " << time_work << endl;
cout << endl;
}
break;
}
case 7:
{
system("cls");
break;
}
case 0:
{
Exit = true;
break;
}
default: continue;
}
}
}