/
undirected_test.go
173 lines (161 loc) · 4.38 KB
/
undirected_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
// Copyright ©2012 Dan Kortschak <dan.kortschak@adelaide.edu.au>
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
package graph
import (
"fmt"
check "launchpad.net/gocheck"
)
// Tests
var (
uv = []e{
{1, 4},
{4, 7},
{7, 1},
{9, 7},
{6, 9},
{3, 6},
{9, 3},
{8, 6},
{8, 5},
{5, 2},
{2, 8},
}
nodeEdges = []int{1: 2, 2: 2, 3: 2, 4: 2, 5: 2, 6: 3, 7: 3, 8: 3, 9: 3}
deleteNode = 9
parts = []int{1: 0, 4: 0, 7: 0, 3: 1, 6: 1, 8: 1, 2: 1, 5: 1}
partSizes = []int{3, 5}
)
func undirected(c *check.C, edges []e) (g *Undirected) {
g = NewUndirected()
for _, e := range edges {
u, _ := g.AddID(e.u)
v, _ := g.AddID(e.v)
g.Connect(u, v, 1, 0)
}
return
}
func (s *S) TestUndirected(c *check.C) {
g := undirected(c, uv)
nodes := make(map[int]int)
for _, n := range uv {
nodes[n.u], nodes[n.v] = 1, 1
}
c.Check(g.Order(), check.Equals, len(nodes))
c.Check(g.Size(), check.Equals, len(uv))
}
func (s *S) TestUndirectedMerge(c *check.C) {
g := undirected(c, uv)
order := g.Order()
size := g.Size()
err := g.Merge(g.Node(7), g.Node(9))
if err != nil {
c.Fatal(err)
}
conn, err := g.ConnectingEdges(g.Node(7), g.Node(7))
if err != nil {
c.Fatal(err)
}
c.Check(len(conn), check.Equals, 1)
c.Check(conn[0].String(), check.Equals, "7--7")
c.Check(g.Order(), check.Equals, order-1)
c.Check(g.Size(), check.Equals, size)
c.Check(g.Node(7).Degree(), check.Equals, 6)
c.Check(len(g.Node(7).Edges()), check.Equals, 5)
err = g.Merge(g.Node(6), g.Node(3))
if err != nil {
c.Fatal(err)
}
conn, err = g.ConnectingEdges(g.Node(7), g.Node(6))
if err != nil {
c.Fatal(err)
}
c.Check(len(conn), check.Equals, 2)
}
func (s *S) TestUndirectedConnected(c *check.C) {
g := undirected(c, uv)
n := g.Nodes()
conns := 0
for i := 0; i < g.Order(); i++ {
for j := 0; j < g.Order(); j++ {
if ok, err := g.Connected(n[i], n[j]); ok {
conns++
} else if err != nil {
c.Fatal(err)
}
}
}
c.Check(conns, check.Equals, 2*g.Size()+g.Order())
}
func (s *S) TestUndirectedConnectedComponent(c *check.C) {
g := undirected(c, uv)
f := func(_ Edge) bool { return true }
c.Check(len(g.ConnectedComponents(f)), check.Equals, 1)
g.DeleteByID(deleteNode)
nodes, edges := make(map[int]int), make(map[int]int)
for _, n := range uv {
nodes[n.u], nodes[n.v] = 1, 1
edges[n.u]++
edges[n.v]++
}
c.Check(g.Order(), check.Equals, len(nodes)-1)
c.Check(g.Size(), check.Equals, len(uv)-edges[deleteNode])
cc := g.ConnectedComponents(f)
c.Check(len(cc), check.Equals, 2)
for i, p := range cc {
c.Check(len(p), check.Equals, partSizes[i])
for _, n := range p {
c.Check(parts[n.ID()], check.Equals, i)
}
g0, err := p.BuildUndirected(true)
if err != nil {
c.Fatal(err)
}
c.Check(g0.Order(), check.Equals, partSizes[i])
c.Check(g0.Size(), check.Equals, partSizes[i])
}
}
func (s *S) TestUndirectedBuild(c *check.C) {
g := undirected(c, uv)
g0, err := g.Nodes().BuildUndirected(false)
if err != nil {
c.Fatal(err)
}
for _, n := range g.Nodes() {
id := n.ID()
c.Check(g0.Node(id).ID(), check.Equals, g.Node(id).ID())
}
for i := range g.Edges() {
c.Check(g0.Edge(i).ID(), check.Equals, i)
c.Check(g0.Edge(i).ID(), check.Equals, g.Edge(i).ID())
c.Check(g0.Edge(i).Head().ID(), check.Equals, g.Edge(i).Head().ID())
c.Check(g0.Edge(i).Tail().ID(), check.Equals, g.Edge(i).Tail().ID())
}
}
func (s *S) TestUndirectedRepresentation(c *check.C) {
g := undirected(c, uv)
for i, e := range g.Edges() {
c.Check(e.String(), check.Equals, fmt.Sprintf("%d--%d", uv[i].u, uv[i].v))
}
reps := make([]string, len(uv)+1)
for _, n := range uv {
if reps[n.u] == "" {
c.Check(len(g.Node(n.u).Edges()), check.Equals, nodeEdges[n.u])
reps[n.u] = fmt.Sprintf("%d:%v", n.u, g.Node(n.u).Edges())
}
}
for _, n := range g.Nodes() {
c.Check(n.String(), check.Equals, reps[n.ID()])
}
}