-
Notifications
You must be signed in to change notification settings - Fork 0
/
Evaluator.cpp
46 lines (34 loc) · 1.44 KB
/
Evaluator.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
#include "Evaluator.h"
Evaluator::Evaluator() {
graph_ = {};
}
Evaluator::Evaluator(const Graph &graph) {
// This constructor takes a Graph and creates the Evaluator functor
graph_ = graph;
}
double Evaluator::evaluate(const std::vector<std::vector<int>> &clusters) const {
double fitness = 0;
std::vector<std::vector<int>> adj = graph_.get_adjacency_matrix();
for (auto &cluster:clusters) {
int inside_cluster_edges = 0, total_edges_to_cluster = 0;
for (int i = 0; i < cluster.size(); ++i) {
int node1 = cluster[i];
total_edges_to_cluster += graph_[node1].size();
for (int j = i; j < cluster.size(); ++j) {
int node2 = cluster[j];
if (adj[node1][node2] == 1) {
// We count each edge twice because the edges are undirected
inside_cluster_edges += 2;
}
}
}
double total_edges_proportion = 1.0 * total_edges_to_cluster / (2 * graph_.get_no_edges());
total_edges_proportion *= total_edges_proportion;
fitness += 1.0 * inside_cluster_edges / (2 * graph_.get_no_edges()) - total_edges_proportion;
}
return fitness;
}
// Overloading the () operator so that we can use the object as a function (so called Functor or Callable Object)
double Evaluator::operator()(const std::vector<std::vector<int>> &clusters) const {
return evaluate(clusters);
}