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
|
package build
import (
"testing"
)
func BenchmarkKn(b *testing.B) {
g := Kn(100)
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkComplement(b *testing.B) {
g := Empty(100).Complement()
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkSubgraph(b *testing.B) {
g := Kn(1000).Subgraph(Range(0, 100))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkConnect(b *testing.B) {
g := Kn(50).Connect(0, Kn(50))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkJoin(b *testing.B) {
g := Kn(1).Join(Kn(100), AllEdges())
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkCost(b *testing.B) {
g := Kn(100).AddCost(8)
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkCostFunc(b *testing.B) {
g := Kn(100).AddCostFunc(Cost(8))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkDeleteNone(b *testing.B) {
g := Kn(100).Delete(NoEdges())
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkDeleteOne(b *testing.B) {
g := Kn(100).Delete(Edge(3, 8))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkDeleteAll(b *testing.B) {
g := Kn(100).Delete(AllEdges())
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkAddNone(b *testing.B) {
g := Kn(100).Add(NoEdges())
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkAddOne(b *testing.B) {
g := Kn(100).Add(Edge(3, 8))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkAddAll(b *testing.B) {
g := Kn(100).Add(AllEdges())
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkAddAllCache(b *testing.B) {
g := Specific(Kn(100).Add(AllEdges()))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkUnion(b *testing.B) {
g := Kn(100).Union(Kn(100))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkIntersect(b *testing.B) {
g := Kn(100).Intersect(Kn(100))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkTensor(b *testing.B) {
g := Kn(10).Tensor(Kn(10))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
func BenchmarkCartesian(b *testing.B) {
g := Kn(50).Cartesian(Kn(50))
for i := 0; i < b.N; i++ {
g.Visit(0, func(w int, c int64) (skip bool) {
return
})
}
}
|
