-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSimulationOptions.cpp
More file actions
445 lines (429 loc) · 27.4 KB
/
SimulationOptions.cpp
File metadata and controls
445 lines (429 loc) · 27.4 KB
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
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
/**
* @file SimulationOptions.cpp
* @brief This file contains the implementation of the SimulationOptions class.
*/
#include "SimulationOptions.h"
#include "GraphsGenerating.h"
#include "graphsAlgorithms/Prim.h"
#include "graphsAlgorithms/Kruskal.h"
#include "graphsAlgorithms/Dijkstra.h"
#include "graphsAlgorithms/BellmanFord.h"
#include "graphsAlgorithms/FordFulkersonDFS.h"
#include "graphsAlgorithms/FordFulkersonBFS.h"
#include <iostream>
using namespace std;
/**
* @brief Runs the main menu for the Graph Efficiency program.
*
* This function displays the main menu and handles the user's choice. The user can choose to compute the Minimum Spanning Tree (MST), compute the shortest path, compute the maximum flow, or exit the program.
* If the user chooses to compute the MST, the runMSTMenu function is called.
* If the user chooses to compute the shortest path, the runShortestPathMenu function is called.
* If the user chooses to compute the maximum flow, the runMaxFlowMenu function is called.
* If the user chooses to exit the program, a message is displayed and the function returns.
* If the user enters an invalid choice, an error message is displayed and the menu is displayed again.
*/
void SimulationOptions::runMenu() {
int menuchoice; // Main menu choice
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| MAIN MENU |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Compute the Minimum Spanning Tree (MST) |" << endl;
cout << "| 2 - Compute the shortest path |" << endl;
cout << "| 3 - Compute the the maximum flow |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Exit the program |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> menuchoice;
cout << endl;
switch (menuchoice) {
case 1: {
int mstChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE ALGORITHM FOR MST COMPUTING |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Prim's algorithm |" << endl;
cout << "| 2 - Kruskal's algorithm |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the main menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> mstChoice;
cout << endl;
switch (mstChoice) {
case 1: {
int primChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE OPTION FOR PRIM'S ALGORITHM |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Load graph from file |" << endl;
cout << "| 2 - Generate random graph |" << endl;
cout << "| 3 - Print existed graph |" << endl;
cout << "| 4 - Run the algorithm for adjacency matrix |" << endl;
cout << "| 5 - Run the algorithm for adjacency list |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the previous menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> primChoice;
cout << endl;
switch (primChoice) {
case 1:
GraphsGenerating::loadGraphFromFile();
break;
case 2:
randomGraphGeneratorMenu();
break;
case 3:
cout << "Print existed graph" << endl;
GraphsGenerating::printIncidenceMatrix();
GraphsGenerating::printAdjacencyList();
break;
case 4:
cout << "Run Prim's algorithm for computing minimal spanning tree" << endl;
Prim::TimeCounterMatrix(GraphsGenerating::incMatrix, GraphsGenerating::numVertices, GraphsGenerating::numEdges);
break;
case 5:
cout << "Run Prim's algorithm for computing minimal spanning tree" << endl;
Prim::TimeCounterList(GraphsGenerating::adjList, GraphsGenerating::numVertices);
break;
case 0:
cout << "Back to the previous menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (primChoice != 0);
break;
}
case 2: {
int kruskalChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE OPTION FOR KRUSKAL'S ALGORITHM |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Load graph from file |" << endl;
cout << "| 2 - Generate random graph |" << endl;
cout << "| 3 - Print existed graph |" << endl;
cout << "| 4 - Run the algorithm for adjacency matrix |" << endl;
cout << "| 5 - Run the algorithm for adjacency list |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the previous menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> kruskalChoice;
cout << endl;
switch (kruskalChoice) {
case 1:
GraphsGenerating::loadGraphFromFile();
break;
case 2:
randomGraphGeneratorMenu();
break;
case 3:
cout << "Print existed graph" << endl;
GraphsGenerating::printIncidenceMatrix();
GraphsGenerating::printAdjacencyList();
break;
case 4:
cout << "Run Kruskal's algorithm for computing minimal spanning tree" << endl;
Kruskal::TimeCounterMatrix(GraphsGenerating::incMatrix, GraphsGenerating::numVertices, GraphsGenerating::numEdges);
break;
case 5:
cout << "Run Kruskal's algorithm for computing minimal spanning tree" << endl;
Kruskal::TimeCounterList(GraphsGenerating::adjList, GraphsGenerating::numVertices);
break;
case 0:
cout << "Back to the previous menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (kruskalChoice != 0);
break;
}
case 0:
cout << "Back to the main menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (mstChoice != 0);
break;
}
case 2: {
int spChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE ALGORITHM FOR SHORTEST PATH COMPUTING |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Dijkstra's algorithm |" << endl;
cout << "| 2 - Bellman-Ford algorithm |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the main menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> spChoice;
cout << endl;
switch (spChoice) {
case 1: {
int dijkstraChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE OPTION FOR DIJKSTRA'S ALGORITHM |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Load graph from file |" << endl;
cout << "| 2 - Generate random graph |" << endl;
cout << "| 3 - Print existed graph |" << endl;
cout << "| 4 - Run the algorithm for adjacency matrix |" << endl;
cout << "| 5 - Run the algorithm for adjacency list |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the previous menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> dijkstraChoice;
cout << endl;
switch (dijkstraChoice) {
case 1:
cout << "Load graph from file" << endl;
GraphsGenerating::loadGraphFromFile();
break;
case 2:
randomGraphGeneratorMenu();
break;
case 3:
cout << "Print existed graph" << endl;
GraphsGenerating::printIncidenceMatrix();
GraphsGenerating::printAdjacencyList();
break;
case 4:
cout << "Run Dijkstra's algorithm for computing shortest path" << endl;
Dijkstra::TimeCounterMatrix(GraphsGenerating::incMatrix,
GraphsGenerating::numVertices, GraphsGenerating::numEdges, 0);
break;
case 5:
cout << "Run Dijkstra's algorithm for computing shortest path" << endl;
Dijkstra::TimeCounterList(GraphsGenerating::adjList,
GraphsGenerating::numVertices, 0);
break;
case 0:
cout << "Back to the previous menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (dijkstraChoice != 0);
break;
}
case 2: {
int bellmanFordChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE OPTION FOR BELLMAN-FORD ALGORITHM |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Load graph from file |" << endl;
cout << "| 2 - Generate random graph |" << endl;
cout << "| 3 - Print existed graph |" << endl;
cout << "| 4 - Run the algorithm for adjacency matrix |" << endl;
cout << "| 5 - Run the algorithm for adjacency list |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the previous menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> bellmanFordChoice;
cout << endl;
switch (bellmanFordChoice) {
case 1:
cout << "Load graph from file" << endl;
GraphsGenerating::loadGraphFromFile();
break;
case 2:
randomGraphGeneratorMenu();
break;
case 3:
cout << "Print existed graph" << endl;
GraphsGenerating::printIncidenceMatrix();
GraphsGenerating::printAdjacencyList();
break;
case 4:
cout << "Run Bellman-Ford algorithm for computing shortest path" << endl;
BellmanFord::TimeCounterMatrix(GraphsGenerating::incMatrix, GraphsGenerating::numVertices, GraphsGenerating::numEdges, 0);
break;
case 5:
cout << "Run Bellman-Ford algorithm for computing shortest path" << endl;
BellmanFord::TimeCounterList(GraphsGenerating::adjList, GraphsGenerating::numVertices, 0);
break;
case 0:
cout << "Back to the previous menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (bellmanFordChoice != 0);
break;
}
case 0:
cout << "Back to the main menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (spChoice != 0);
break;
}
case 3: {
int maxFlowChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE ALGORITHM FOR MAXIMUM FLOW |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Ford-Fulkerson algorithm DFS |" << endl;
cout << "| 2 - Ford-Fulkerson algorithm BFS |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the main menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> maxFlowChoice;
cout << endl;
switch (maxFlowChoice) {
case 1: {
int fordFulkersonDFSChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE OPTION FOR DFS FORD-FULKERSON ALGORITHM|" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Load graph from file |" << endl;
cout << "| 2 - Generate random graph |" << endl;
cout << "| 3 - Print existed graph |" << endl;
cout << "| 4 - Run the algorithm for adjacency matrix |" << endl;
cout << "| 5 - Run the algorithm for adjacency list |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the previous menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> fordFulkersonDFSChoice;
cout << endl;
switch (fordFulkersonDFSChoice) {
case 1:
cout << "Load graph from file" << endl;
GraphsGenerating::loadGraphFromFile();
break;
case 2:
randomGraphGeneratorMenu();
break;
case 3:
cout << "Print existed graph" << endl;
GraphsGenerating::printIncidenceMatrix();
GraphsGenerating::printAdjacencyList();
break;
case 4:
cout << "Run Ford-Fulkerson algorithm for computing maximum flow" << endl;
FordFulkersonDFS::TimeCounterIncMatrix(GraphsGenerating::incMatrix, 0, GraphsGenerating::numVertices - 1, GraphsGenerating::numVertices, GraphsGenerating::numEdges);
break;
case 5:
cout << "Run Ford-Fulkerson algorithm for computing maximum flow" << endl;
FordFulkersonDFS::TimeCounterList(GraphsGenerating::adjList, 0, GraphsGenerating::numVertices - 1, GraphsGenerating::numVertices);
break;
case 0:
cout << "Back to the previous menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (fordFulkersonDFSChoice != 0);
break;
}
case 2: {
int fordFulkersonBFSChoice;
do {
cout << "|---------------------------------------------------|" << endl;
cout << "| CHOOSE THE OPTION FOR BFS FORD-FULKERSON ALGORITHM|" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 1 - Load graph from file |" << endl;
cout << "| 2 - Generate random graph |" << endl;
cout << "| 3 - Print existed graph |" << endl;
cout << "| 4 - Run the algorithm for adjacency matrix |" << endl;
cout << "| 5 - Run the algorithm for adjacency list |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "| 0 - Back to the previous menu |" << endl;
cout << "|---------------------------------------------------|" << endl;
cout << "Enter your choice: ";
cin >> fordFulkersonBFSChoice;
cout << endl;
switch (fordFulkersonBFSChoice) {
case 1:
cout << "Load graph from file" << endl;
GraphsGenerating::loadGraphFromFile();
break;
case 2:
randomGraphGeneratorMenu();
break;
case 3:
cout << "Print existed graph" << endl;
GraphsGenerating::printIncidenceMatrix();
GraphsGenerating::printAdjacencyList();
break;
case 4:
cout << "Run Ford-Fulkerson algorithm for computing maximum flow" << endl;
FordFulkersonBFS::TimeCounterIncMatrix(GraphsGenerating::incMatrix, 0, GraphsGenerating::numVertices - 1, GraphsGenerating::numVertices, GraphsGenerating::numEdges);
break;
case 5:
cout << "Run Ford-Fulkerson algorithm for computing maximum flow" << endl;
FordFulkersonBFS::TimeCounterList(GraphsGenerating::adjList, 0, GraphsGenerating::numVertices - 1, GraphsGenerating::numVertices);
break;
case 0:
cout << "Back to the previous menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (fordFulkersonBFSChoice != 0);
break;
}
case 0:
cout << "Back to the main menu" << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (maxFlowChoice != 0);
break;
}
case 0:
cout << "Exiting the program..." << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
break;
}
} while (menuchoice != 0);
}
/**
* @brief Runs the menu for generating a random graph.
*
* This function prompts the user to enter the number of vertices and the density of the graph, then calls the generateRandomGraph function from the GraphsGenerating class to generate the graph.
*/
void SimulationOptions::randomGraphGeneratorMenu() {
cout << "Generating random graph" << endl;
cout << "Enter the number of vertices: ";
int vertices;
cin >> vertices;
cout << endl;
cout << "Enter the density of the graph (in %): ";
int density;
cin >> density;
cout << endl;
GraphsGenerating::generateRandomGraph(vertices, density);
}