-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
110 lines (93 loc) · 3.18 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
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
//
// main.cpp
// GeneticProgram
//
// Created by Russell Shurts on 5/5/11.
// Copyright 2011 __MyCompanyName__. All rights reserved.
//
#include <iostream>
#include "BinaryTree.h"
#include "ExpressionTree.h"
#include "GeneticProgram.h"
using namespace std;
int main()
{
int generationCounter = 1;
double fitness[100];
evalTreePtr population[100][31];
createTreePopulation(population, 0);
cout << "Generation, Tree Number, Fitness, Tree" << endl;
do
{
for (int tree = 0; tree < 100; tree++)
{
fitness[tree] = findFitness(population[tree][0]);
}
sort(population, fitness, 0, 99);
for (int tree = 0; tree < 100; tree++)
{
cout << generationCounter << ", " << tree << ", " << fitness[tree] << ", ";
inOrderTraverse(population[tree][0]);
cout << endl;
}
createNextGeneration(population, fitness, generationCounter);
generationCounter++;
} while (fitness[0] != 0);
cout << generationCounter-1 << ", " << 0 << ", " << fitness[0] << ", ";
inOrderTraverse(population[0][0]);
cout << endl;
//cout << "Creation & Fitness calculation test:" << endl;
//for (int tree = 0; tree < 100; tree++)
//{
// inOrderTraverse(population[tree][0]);
// cout << endl;
// fitness[tree] = findFitness(population[tree][0]);
// cout << fitness[tree] << endl;
//}
//cout << "Mutation Test:" << endl;
//inOrderTraverse(population[0][0]);
//cout << endl;
//mutateTree(population[0][1], generationCounter);
//mutateTree(population[0][3], generationCounter);
//mutateTree(population[0][7], generationCounter);
//mutateTree(population[0][8], generationCounter);
//inOrderTraverse(population[0][0]);
//cout << endl;
//cout << "Crossover Test:" << endl;
//inOrderTraverse(population[0][0]);
//cout << endl;
//inOrderTraverse(population[1][0]);
//cout << endl;
//crossoverTrees(population[0][3], population[1][3]); // crossover starting from node 3
//inOrderTraverse(population[0][0]);
//cout << endl;
//inOrderTraverse(population[1][0]);
//cout << endl;
//cout << "Copy Test:" << endl;
//inOrderTraverse(population[0][0]);
//cout << endl;
//inOrderTraverse(population[1][0]);
//cout << endl;
//copyTree(population[0][0], population[1][0]);
//inOrderTraverse(population[0][0]);
//cout << endl;
//inOrderTraverse(population[1][0]);
//cout << endl;
//cout << "Sort Test: " << endl;
//for (int tree = 0; tree < 100; tree++)
//{
// fitness[tree] = findFitness(population[tree][0]);
// cout << generationCounter << ", " << fitness[tree] << ", ";
// inOrderTraverse(population[tree][0]);
// cout << endl;
//}
//cout << "Sorted: " << endl;
//sort(population, fitness, 0, 99);
//for (int tree = 0; tree < 100; tree++)
//{
// cout << generationCounter << ", " << fitness[tree] << ", ";
// inOrderTraverse(population[tree][0]);
// cout << endl;
//}
return 0;
}// main