This repository has been archived by the owner on Jan 2, 2024. It is now read-only.
forked from MaxHalford/eaopt
-
Notifications
You must be signed in to change notification settings - Fork 0
/
distance_test.go
190 lines (184 loc) · 5.28 KB
/
distance_test.go
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
package eaopt
import (
"errors"
"fmt"
"testing"
)
func TestDistanceMemoizer(t *testing.T) {
var (
dm = newDistanceMemoizer(l1Distance)
a = Individual{Genome: Vector{1, 1, 1}, ID: "1"}
b = Individual{Genome: Vector{3, 3, 3}, ID: "2"}
c = Individual{Genome: Vector{6, 6, 6}, ID: "3"}
)
// Check the number of calculations is initially 0
if dm.nCalculations != 0 {
t.Error("nCalculations is not initialized to 0")
}
// Check the distance between the 1st and itself
if dm.GetDistance(a, a) != 0 {
t.Error("Wrong calculated distance")
}
// Check the number of calculations is initially 0
if dm.nCalculations != 0 {
t.Error("nCalculations should not have increased")
}
// Check the distance between the 1st and the 2nd individual
if dm.GetDistance(a, b) != 6 {
t.Error("Wrong calculated distance")
}
// Check the number of calculations has increased by 1
if dm.nCalculations != 1 {
t.Error("nCalculations has not increased")
}
// Check the distance between the 2nd and the 1st individual
if dm.GetDistance(b, a) != 6 {
t.Error("Wrong calculated distance")
}
// Check the number of calculations has not increased
if dm.nCalculations != 1 {
t.Error("nCalculations has increased")
}
// Check the distance between the 1st and the 3rd individual
if dm.GetDistance(a, c) != 15 {
t.Error("Wrong calculated distance")
}
// Check the distance between the 1st and the 3rd individual
if dm.GetDistance(b, c) != 9 {
t.Error("Wrong calculated distance")
}
}
func TestSortByDistanceToMedoid(t *testing.T) {
var (
indis = Individuals{
Individual{Genome: Vector{3, 3, 3}, Fitness: 0},
Individual{Genome: Vector{2, 2, 2}, Fitness: 1},
Individual{Genome: Vector{5, 5, 5}, Fitness: 2},
}
dm = newDistanceMemoizer(l1Distance)
)
indis.SortByDistanceToMedoid(dm)
for i := range indis {
if indis[i].Fitness != float64(i) {
t.Error("Individuals were not sorted according to their distance to the medoid")
}
}
}
func TestRebalanceClusters(t *testing.T) {
var testCases = []struct {
clusters []Individuals
dm DistanceMemoizer
minClusterSize uint
newClusterSizes []uint
err error
}{
{
clusters: []Individuals{
Individuals{
Individual{Genome: Vector{1, 1, 1}, ID: "1"},
Individual{Genome: Vector{1, 1, 1}, ID: "2"},
Individual{Genome: Vector{1, 1, 1}, ID: "3"},
Individual{Genome: Vector{2, 2, 2}, ID: "4"}, // Second furthest away from the cluster
Individual{Genome: Vector{3, 3, 3}, ID: "5"}, // Furthest away from the cluster
},
Individuals{
Individual{Genome: Vector{2, 2, 2}, ID: "6"},
},
Individuals{
Individual{Genome: Vector{3, 3, 3}, ID: "7"},
},
},
dm: newDistanceMemoizer(l1Distance),
minClusterSize: 2,
newClusterSizes: []uint{3, 2, 2},
err: nil,
},
{
clusters: []Individuals{
Individuals{
Individual{Genome: Vector{1, 1, 1}, ID: "1"},
Individual{Genome: Vector{1, 1, 1}, ID: "2"},
},
Individuals{},
},
dm: newDistanceMemoizer(l1Distance),
minClusterSize: 1,
newClusterSizes: []uint{2, 0},
err: errors.New("Cluster number 2 is empty"),
},
{
clusters: []Individuals{
Individuals{
Individual{Genome: Vector{1, 1, 1}, ID: "1"},
Individual{Genome: Vector{1, 1, 1}, ID: "2"},
},
Individuals{
Individual{Genome: Vector{1, 1, 1}, ID: "3"},
},
},
dm: newDistanceMemoizer(l1Distance),
minClusterSize: 2,
newClusterSizes: []uint{2, 0},
err: errors.New("Not enough individuals to rebalance"),
},
}
for i, tc := range testCases {
t.Run(fmt.Sprintf("TC %d", i), func(t *testing.T) {
var err = rebalanceClusters(tc.clusters, tc.dm, tc.minClusterSize)
// Check if the error is nil or not
if (err == nil) != (tc.err == nil) {
t.Errorf("Wrong error in test case number %d", i)
}
// Check new cluster sizes
if err == nil {
for j, cluster := range tc.clusters {
if len(cluster) != int(tc.newClusterSizes[j]) {
t.Errorf("Wrong new cluster size in test case number %d", i)
}
}
}
})
}
}
// If a cluster is empty then rebalancing is impossible
func TestRebalanceClustersEmptyCluster(t *testing.T) {
var (
clusters = []Individuals{
Individuals{
Individual{Genome: Vector{1, 1, 1}, ID: "1"},
Individual{Genome: Vector{1, 1, 1}, ID: "2"},
Individual{Genome: Vector{1, 1, 1}, ID: "3"},
},
Individuals{},
}
dm = newDistanceMemoizer(l1Distance)
)
var err = rebalanceClusters(clusters, dm, 2)
if err == nil {
t.Error("rebalanceClusters should have returned an error")
}
}
// It's impossible to put 2 Individuals inside each cluster if there are 3
// clusters and 5 individuals in total
func TestRebalanceClustersTooManyMissing(t *testing.T) {
var (
clusters = []Individuals{
Individuals{
Individual{Genome: Vector{1, 1, 1}, ID: "1"},
Individual{Genome: Vector{1, 1, 1}, ID: "2"},
Individual{Genome: Vector{1, 1, 1}, ID: "3"},
},
Individuals{
Individual{Genome: Vector{2, 2, 2}, ID: "6"},
},
Individuals{
Individual{Genome: Vector{3, 3, 3}, ID: "7"},
},
}
dm = newDistanceMemoizer(l1Distance)
)
var err = rebalanceClusters(clusters, dm, 2)
if err == nil {
t.Error("rebalanceClusters should have returned an error")
}
}