+/GENN

genetically evolving neural networks

git clone https://git.julia.blue/+/GENN

Joseph RyanRestructure file system add graphics libcc48e92

imdone-todo-updates
3.4 KiB100 linesraw
1#include "../include/Network.h"
2
3Network::Network(Genome &g) {
4    for (int i = 0; i < g.inputs; ++i) {
5        inputs.push_back(new Neuron(i));
6    }
7    for (int i = 0; i < g.outputs; ++i) {
8        outputs.push_back(new Neuron(g.inputs + i));
9    }
10    for (int i = 0; i < g.structure.size(); ++i) {
11        //Only constructs enabled connections for performance
12        if (g.structure[i].enabled) {
13            //Computes Inputs
14            structure.push_back(Connection(g.structure[i].weight));
15            if (g.structure[i].input < g.inputs) {
16                structure.back().in = inputs[g.structure[i].input];
17            } else if (g.structure[i].input < g.inputs + g.outputs) {
18                structure.back().in = inputs[g.structure[i].input - g.inputs];
19            } else {
20                bool temp = true;
21                for (int j = 0; j < hiddenNodes.size(); ++j) {
22                    if (hiddenNodes[j]->id == g.structure[i].input) {
23                        temp = false;
24                        structure.back().in = hiddenNodes[j];
25                    }
26                }
27                if (temp) {
28                    hiddenNodes.push_back(new Neuron(g.structure[i].input));
29                    structure.back().in = hiddenNodes.back();
30                }
31            }
32            //Computes Outputs
33            if (g.structure[i].output < g.inputs + g.outputs) {
34                structure.back().out = outputs[g.structure[i].output - g.inputs];
35            } else {
36                bool temp = true;
37                for (int j = 0; j < hiddenNodes.size(); ++j) {
38                    if (hiddenNodes[j]->id == g.structure[i].output) {
39                        temp = false;
40                        structure.back().out = hiddenNodes[j];
41                    }
42                }
43                if (temp) {
44                    hiddenNodes.push_back(new Neuron(g.structure[i].output));
45                    structure.back().out = hiddenNodes.back();
46                }
47            }
48        }
49    }
50}
51
52double Network::sigmoid(double a) {
53    return 2. / (1 + exp(-4.9 * a)) - 1;
54}
55
56void Network::propagate(double a[], double b[]) {
57    for (int i = 0; i < inputs.size(); ++i) {
58        inputs[i]->value = a[i];
59    }
60    for (int i = 0; i < hiddenNodes.size(); ++i) {
61        hiddenNodes[i]->sum = 0;
62    }
63    for (int i = 0; i < outputs.size(); ++i) {
64        outputs[i]->sum = 0;
65    }
66    for (int i = 0; i < structure.size(); ++i) {
67        structure[i].out->sum += structure[i].in->value * structure[i].weight;
68        //Recomputes values in real time. might be a performance hit
69        //solution would be to do it as a batch after propagation
70        //that would take more steps to accurately propagate though
71        structure[i].out->value = sigmoid(structure[i].out->sum);
72    }
73    for (int i = 0; i < outputs.size(); ++i) {
74        b[i] = outputs[i]->value;
75    }
76}
77
78void Network::reset() {
79    for (int i = 0; i < inputs.size(); ++i) {
80        inputs[i]->value = 0;
81    }
82    for (int i = 0; i < hiddenNodes.size(); ++i) {
83        hiddenNodes[i]->value = 0;
84    }
85    for (int i = 0; i < outputs.size(); ++i) {
86        outputs[i]->value = 0;
87    }
88}
89
90Network::~Network() {
91    for (int i = 0; i < inputs.size(); ++i) {
92        delete inputs[i];
93    }
94    for (int i = 0; i < hiddenNodes.size(); ++i) {
95        delete hiddenNodes[i];
96    }
97    for (int i = 0; i < outputs.size(); ++i) {
98        delete outputs[i];
99    }
100}