forked from getmubarak/cleancode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
78 lines (70 loc) · 2.09 KB
/
main.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
#include <iostream>
#include "tsp.h"
using namespace std;
int main()
{
srand(time(NULL)); // random numbers
// creates the graph1 with parameters: number of vertexes and initial vertex
Graph * graph1 = new Graph(5, 0);
// add edges
graph1->addEdge(0, 1, 1);
graph1->addEdge(1, 0, 1);
graph1->addEdge(0, 2, 3);
graph1->addEdge(2, 0, 3);
graph1->addEdge(0, 3, 4);
graph1->addEdge(3, 0, 4);
graph1->addEdge(0, 4, 5);
graph1->addEdge(4, 0, 5);
graph1->addEdge(1, 2, 1);
graph1->addEdge(2, 1, 1);
graph1->addEdge(1, 3, 4);
graph1->addEdge(3, 1, 4);
graph1->addEdge(1, 4, 8);
graph1->addEdge(4, 1, 8);
graph1->addEdge(2, 3, 5);
graph1->addEdge(3, 2, 5);
graph1->addEdge(2, 4, 1);
graph1->addEdge(4, 2, 1);
graph1->addEdge(3, 4, 2);
graph1->addEdge(4, 3, 2);
// creates the graph2
Graph * graph2 = new Graph(4, 0);
// add edges
graph2->addEdge(0, 1, 2);
graph2->addEdge(1, 0, 2);
graph2->addEdge(0, 2, 6);
graph2->addEdge(2, 0, 6);
graph2->addEdge(0, 3, 3);
graph2->addEdge(3, 0, 3);
graph2->addEdge(1, 3, 7);
graph2->addEdge(3, 1, 7);
graph2->addEdge(1, 2, 4);
graph2->addEdge(2, 1, 4);
graph2->addEdge(2, 3, 2);
graph2->addEdge(3, 2, 2);
// creates the graph3
Graph * graph3 = new Graph(4, 0);
// add edges
graph3->addEdge(0, 1, 10);
graph3->addEdge(1, 0, 10);
graph3->addEdge(1, 3, 20);
graph3->addEdge(3, 1, 20);
graph3->addEdge(0, 2, 15);
graph3->addEdge(2, 0, 15);
graph3->addEdge(1, 3, 25);
graph3->addEdge(3, 1, 25);
graph3->addEdge(2, 3, 30);
graph3->addEdge(3, 2, 30);
graph3->addEdge(1, 2, 35);
graph3->addEdge(2, 1, 35);
// creates random graph, parameter true is for generate the graph
Graph * graph4 = new Graph(50, 0, true);
graph4->showInfoGraph();
// parameters: the graph, population size, generations and mutation rate
// optional parameters: show_population
Genetic genetic(graph4, 10, 1000, 5, true);
const clock_t begin_time = clock(); // gets time
genetic.run(); // runs the genetic algorithm
cout << "\n\nTime for to run the genetic algorithm: " << float(clock () - begin_time) / CLOCKS_PER_SEC << " seconds."; // shows time in seconds
return 0;
}