-
Notifications
You must be signed in to change notification settings - Fork 1
/
astar_test.go
312 lines (291 loc) · 6.65 KB
/
astar_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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
package astar_test
import (
"math/rand"
"testing"
"time"
. "github.com/pietv/astar"
)
func init() {
rand.Seed(time.Now().UnixNano())
}
type graph struct {
edges map[string]map[string]float64
curr string
}
var (
Start string
Finish string
estimateFunc = func(given interface{}) float64 { return 1 }
)
func (g graph) Start() interface{} { return Start }
func (g graph) Finish() bool { return g.curr == Finish }
func (g *graph) Move(state interface{}) { g.curr = state.(string) }
func (g graph) Successors() []interface{} {
successors := []interface{}{}
for succ := range g.edges[g.curr] {
successors = append(successors, succ)
}
return successors
}
func (g graph) Cost(given interface{}) float64 {
return g.edges[g.curr][given.(string)]
}
func (g graph) Estimate(given interface{}) float64 {
return estimateFunc(given)
}
var BasicTests = []struct {
name string
g *graph
out string
}{
{
"trivial",
// (A)--1--(B)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1},
}},
"AB",
},
{
"prefer longer",
// (A)
// | \
// | 3
// 1 > (C)--1--(D)
// | 1
// | /
// (B)
&graph{edges: map[string]map[string]float64{
"A": {"C": 3, "B": 1},
"B": {"A": 1, "C": 1},
"C": {"A": 3, "B": 1, "D": 1},
"D": {"C": 1},
}},
"ABCD",
},
{
"prefer shorter",
// (A)
// | \
// | 1
// 1 > (C)-----(D)
// | 1
// | /
// (B)
&graph{edges: map[string]map[string]float64{
"A": {"C": 1, "B": 1},
"B": {"A": 1, "C": 1},
"C": {"A": 1, "B": 1, "D": 1},
"D": {"C": 1},
}},
"ACD",
},
{
"directly connected, but bad",
// (A)--1--(B)
// | |
// 4 1
// | |
// (D)--1--(C)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1, "D": 4},
"B": {"A": 1, "C": 1},
"C": {"B": 1, "D": 1},
"D": {"C": 1, "A": 4},
}},
"ABCD",
},
{
"directly connected, but good",
// (A)--1--(B)
// | |
// 1 1
// | |
// (D)--1--(C)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1, "D": 1},
"B": {"A": 1, "C": 1},
"C": {"B": 1, "D": 1},
"D": {"C": 1, "A": 1},
}},
"AD",
},
{
"directly connected, equal cost",
// (A)--1--(B)
// | |
// 3 1
// | |
// (D)--1--(C)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1, "D": 3},
"B": {"A": 1, "C": 1},
"C": {"B": 1, "D": 1},
"D": {"C": 1, "A": 3},
}},
"AD",
},
{
"zigzag",
// (A)--4--(B)--1--(C)--4--(D)
// | | | |
// 1 1 1 1
// | | | |
// (E)--1--(F)--4--(G)--1--(H)
&graph{edges: map[string]map[string]float64{
"A": {"B": 4, "E": 1},
"B": {"A": 4, "F": 1, "C": 1},
"C": {"B": 1, "G": 1, "D": 4},
"D": {"C": 4, "H": 1},
"E": {"A": 1, "F": 1},
"F": {"E": 1, "B": 1, "G": 4},
"G": {"F": 4, "C": 1, "H": 1},
"H": {"G": 1, "D": 1},
}},
"AEFBCGHD",
},
}
var EstimateTests = []struct {
name string
g *graph
estimate func(interface{}) float64
out string
}{
{
"directly connected, but bad",
// (A)--1--(B)
// | |
// 4 1
// | |
// (D)--1--(C)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1, "D": 4},
"B": {"A": 1, "C": 1},
"C": {"B": 1, "D": 1},
"D": {"C": 1, "A": 4},
}},
estimateFunc,
"ABCD",
},
{
"directly connected, equal cost",
// (A)--1--(B)
// | |
// 3 1
// | |
// (D)--1--(C)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1, "D": 3},
"B": {"A": 1, "C": 1},
"C": {"B": 1, "D": 1},
"D": {"C": 1, "A": 3},
}},
estimateFunc,
"ABCD",
},
{
"above",
// (A)--1--(B)--1--(C) (A)---->(B)---->(C)
// | | | |
// 1 1 1 |
// | | | V
// (D)--1--(E)--1--(F) (F)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1, "D": 1},
"B": {"A": 1, "E": 1, "C": 1},
"C": {"B": 1, "F": 1},
"D": {"A": 1, "E": 1},
"E": {"D": 1, "B": 1, "F": 1},
"F": {"E": 1, "C": 1},
}},
func(given interface{}) float64 {
return map[string]float64{
"A": 3, "B": 2, "C": 1,
"D": 4, "E": 4, "F": 0,
}[given.(string)]
},
"ABCF",
},
{
"below",
// (A)--1--(B)--1--(C) (A)
// | | | |
// 1 1 1 |
// | | | V
// (D)--1--(E)--1--(F) (D)---->(E)---->(F)
&graph{edges: map[string]map[string]float64{
"A": {"B": 1, "D": 1},
"B": {"A": 1, "E": 1, "C": 1},
"C": {"B": 1, "F": 1},
"D": {"A": 1, "E": 1},
"E": {"D": 1, "B": 1, "F": 1},
"F": {"E": 1, "C": 1},
}},
func(given interface{}) float64 {
return map[string]float64{
"A": 3, "B": 4, "C": 4,
"D": 2, "E": 1, "F": 0,
}[given.(string)]
},
"ADEF",
},
}
func stringize(in []interface{}) (out string) {
for _, step := range in {
out += step.(string)
}
return
}
func TestTrivial(t *testing.T) {
Start, Finish = "A", "A"
if path, _, _ := Search(&graph{edges: map[string]map[string]float64{}}); stringize(path) != "A" {
t.Errorf("empty setup: got %v, want A", path)
}
Start, Finish = "", "A"
if path, _, _ := Search(&graph{edges: map[string]map[string]float64{
"A": {},
}}); stringize(path) != "" {
t.Errorf("no start: got %v, want empty", path)
}
Start, Finish = "A", "A"
if path, _, _ := Search(&graph{edges: map[string]map[string]float64{
"A": {},
}}); stringize(path) != "A" {
t.Errorf("no successors: got %v, want A", path)
}
Start, Finish = "A", "A"
if path, _, _ := Search(&graph{edges: map[string]map[string]float64{
"A": {"A": 1},
}}); stringize(path) != "A" {
t.Errorf("same successor: got %v, want A", path)
}
Start, Finish = "A", "B"
if path, _, err := Search(&graph{edges: map[string]map[string]float64{
"A": {"A": 1},
}}); err == nil {
t.Errorf("unreachable finish: got %v, want error", path)
}
}
func TestBasic(t *testing.T) {
for _, test := range BasicTests {
Start, Finish = test.out[:1], test.out[len(test.out)-1:]
if actual, _, err := Search(test.g); stringize(actual) != test.out {
t.Errorf("%q: got %v, want %v", test.name, stringize(actual), test.out)
if err != nil {
t.Errorf("%q: failed with error %v", test.name, err)
}
}
}
}
func TestEstimate(t *testing.T) {
for _, test := range EstimateTests {
Start, Finish = test.out[:1], test.out[len(test.out)-1:]
estimateFunc = test.estimate
if path, actual, err := Search(test.g); stringize(actual) != test.out {
t.Errorf("%q: got %v, want %v, path %v", test.name, stringize(actual), test.out, path)
if err != nil {
t.Errorf("%q: failed with error %v", test.name, err)
}
}
}
}