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
|
package graph
import (
"math/rand"
"testing"
)
func TestShortestPath(t *testing.T) {
g := New(6)
g.AddCost(0, 1, 1)
g.AddCost(0, 2, 1)
g.AddCost(0, 3, 3)
g.AddCost(1, 3, 0)
g.AddCost(2, 3, 1)
g.AddCost(2, 5, 8)
g.AddCost(3, 5, 7)
g.AddCost(1, 5, -1)
parent, dist := ShortestPaths(g, 0)
expParent := []int{-1, 0, 0, 1, -1, 3}
expDist := []int64{0, 1, 1, 1, -1, 8}
if mess, diff := diff(parent, expParent); diff {
t.Errorf("ShortestPaths->parent %s", mess)
}
if mess, diff := diff(dist, expDist); diff {
t.Errorf("ShortestPaths->dist %s", mess)
}
path, d := ShortestPath(g, 0, 5)
if mess, diff := diff(path, []int{0, 1, 3, 5}); diff {
t.Errorf("ShortestPath->path %s", mess)
}
if mess, diff := diff(d, int64(8)); diff {
t.Errorf("ShortestPath->dist %s", mess)
}
path, d = ShortestPath(g, 0, 0)
if mess, diff := diff(path, []int{0}); diff {
t.Errorf("ShortestPath->path %s", mess)
}
if mess, diff := diff(d, int64(0)); diff {
t.Errorf("ShortestPath->dist %s", mess)
}
path, d = ShortestPath(g, 0, 4)
if mess, diff := diff(path, []int{}); diff {
t.Errorf("ShortestPath->path %s", mess)
}
if mess, diff := diff(d, int64(-1)); diff {
t.Errorf("ShortestPath->dist %s", mess)
}
}
func BenchmarkShortestPaths(b *testing.B) {
n := 1000
b.StopTimer()
g := New(n)
for i := 0; i < n; i++ {
g.Add(0, rand.Intn(n))
g.Add(rand.Intn(n), rand.Intn(n))
}
b.StartTimer()
for i := 0; i < b.N; i++ {
_, _ = ShortestPaths(g, 0)
}
}
|
