forked from TheAlgorithms/Go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
articulationpoints_test.go
82 lines (73 loc) · 1.07 KB
/
articulationpoints_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
package graph
import (
"reflect"
"testing"
)
func TestArticulationPoints(t *testing.T) {
var testCases = []struct {
description string
graph Graph
expected []bool
}{
{
"Linear tree structure",
Graph{
vertices: 5,
edges: map[int]map[int]int{
0: {
1: 0,
},
1: {
0: 0,
2: 0,
},
2: {
1: 0,
3: 0,
},
3: {
2: 0,
4: 0,
},
},
},
[]bool{false, true, true, true, false},
}, {
"A complete graph",
Graph{
vertices: 4,
edges: map[int]map[int]int{
0: {
1: 0,
2: 0,
3: 0,
},
1: {
0: 0,
2: 0,
3: 0,
},
2: {
0: 0,
1: 0,
3: 0,
},
3: {
0: 0,
1: 0,
2: 0,
},
},
},
[]bool{false, false, false, false},
},
}
for _, test := range testCases {
t.Run(test.description, func(t *testing.T) {
is_ap := ArticulationPoint(&test.graph)
if !reflect.DeepEqual(is_ap, test.expected) {
t.Logf("FAIL: %s", test.description)
}
})
}
}