-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdset_test.go
85 lines (75 loc) · 2.26 KB
/
dset_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
package ds
import (
_ "fmt"
. "github.com/smartystreets/goconvey/convey"
"math/rand"
"testing"
)
func TestDset(t *testing.T) {
Convey("Test Find", t, func() {
var a Disjoint_Set_I
a = MakeDJSet(3)
So(a.Find(0), ShouldNotEqual, a.Find(1))
So(a.Find(0), ShouldNotEqual, a.Find(2))
So(a.Find(1), ShouldNotEqual, a.Find(2))
})
Convey("Test Union", t, func() {
var a Disjoint_Set_I
a = MakeDJSet(4)
So(a.Find(0), ShouldNotEqual, a.Find(1))
So(a.Find(0), ShouldNotEqual, a.Find(2))
So(a.Find(0), ShouldNotEqual, a.Find(3))
So(a.Find(1), ShouldNotEqual, a.Find(2))
So(a.Find(1), ShouldNotEqual, a.Find(3))
So(a.Find(2), ShouldNotEqual, a.Find(3))
a.Union(0, 0)
So(a.Find(0), ShouldNotEqual, a.Find(1))
So(a.Find(0), ShouldNotEqual, a.Find(2))
So(a.Find(0), ShouldNotEqual, a.Find(3))
So(a.Find(1), ShouldNotEqual, a.Find(2))
So(a.Find(1), ShouldNotEqual, a.Find(3))
So(a.Find(2), ShouldNotEqual, a.Find(3))
a.Union(0, 1)
So(a.Find(0), ShouldEqual, a.Find(1))
So(a.Find(0), ShouldNotEqual, a.Find(2))
So(a.Find(0), ShouldNotEqual, a.Find(3))
So(a.Find(1), ShouldNotEqual, a.Find(2))
So(a.Find(1), ShouldNotEqual, a.Find(3))
So(a.Find(2), ShouldNotEqual, a.Find(3))
a.Union(2, 2)
So(a.Find(0), ShouldEqual, a.Find(1))
So(a.Find(0), ShouldNotEqual, a.Find(2))
So(a.Find(0), ShouldNotEqual, a.Find(3))
So(a.Find(1), ShouldNotEqual, a.Find(2))
So(a.Find(1), ShouldNotEqual, a.Find(3))
So(a.Find(2), ShouldNotEqual, a.Find(3))
a.Union(2, 3)
So(a.Find(0), ShouldEqual, a.Find(1))
So(a.Find(0), ShouldNotEqual, a.Find(2))
So(a.Find(0), ShouldNotEqual, a.Find(3))
So(a.Find(1), ShouldNotEqual, a.Find(2))
So(a.Find(1), ShouldNotEqual, a.Find(3))
So(a.Find(2), ShouldEqual, a.Find(3))
a.Union(3, 1)
So(a.Find(0), ShouldEqual, a.Find(1))
So(a.Find(0), ShouldEqual, a.Find(2))
So(a.Find(0), ShouldEqual, a.Find(3))
So(a.Find(1), ShouldEqual, a.Find(2))
So(a.Find(1), ShouldEqual, a.Find(3))
So(a.Find(2), ShouldEqual, a.Find(3))
})
}
func BenchmarkFind(b *testing.B) {
var a Disjoint_Set_I
a = MakeDJSet(b.N)
for i := 0; i < b.N; i++ {
a.Find(rand.Intn(b.N))
}
}
func BenchmarkUnion(b *testing.B) {
var a Disjoint_Set_I
a = MakeDJSet(b.N)
for i := 0; i < b.N; i++ {
a.Union(rand.Intn(b.N), rand.Intn(b.N))
}
}