forked from christian-oudard/district_borders
/
test.py
198 lines (183 loc) · 3.76 KB
/
test.py
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
from nose.tools import assert_equal
from district_borders import (
polygons_to_graph,
graph_edges,
segment_lattice_points,
merge_corners_onto_borders,
continue_straight_lines,
)
def test_polygons_to_graph():
# 012345
# 0 A--B-C
# 1 | | |
# 2 D--E-F
# 3 | |
# 4 | |
# 5 G----H
a = (0, 0)
b = (3, 0)
c = (5, 0)
d = (0, 2)
e = (3, 2)
f = (5, 2)
g = (0, 5)
h = (5, 5)
polygons = [
[a, b, e, d],
[b, c, f, e],
[d, f, h, g],
]
graph = polygons_to_graph(polygons)
assert_equal(
graph,
{
a: {b, d},
b: {a, c, e},
c: {b, f},
d: {a, e, f, g},
e: {b, d, f},
f: {c, e, d, h},
g: {d, h},
h: {g, f},
}
)
def test_graph_edges():
a, b, c, d, e = range(5)
cases = [
(
{a: {b}, b: {a}},
[(a, b)]
),
(
{
a: {b}, b: {a},
c: {d}, d: {c},
},
[(a, b), (c, d)],
),
(
{
a: {b, c},
b: {a, c},
c: {a, b},
},
[(a, b), (a, c), (b, c)],
),
]
for graph, target_edges in cases:
def test(target_edges):
assert_equal(sorted(graph_edges(graph)), target_edges)
yield test, target_edges
def test_segment_lattice_points():
assert_equal(
segment_lattice_points((0, 0), (0, 4)),
[(0, 1), (0, 2), (0, 3)],
)
assert_equal(
segment_lattice_points((2, 2), (5, 2)),
[(3, 2), (4, 2)],
)
assert_equal(
segment_lattice_points((-3, -3), (3, 3)),
[(-2, -2), (-1, -1), (0, 0), (1, 1), (2, 2)]
)
assert_equal(
segment_lattice_points((0, 0), (6, 12)),
[(1, 2), (2, 4), (3, 6), (4, 8), (5, 10)],
)
assert_equal(
segment_lattice_points((0, 0), (4, 6)),
[(2, 3)],
)
assert_equal(
segment_lattice_points((0, 0), (5, 13)),
[],
)
def test_merge_corners_onto_borders():
# 01234567
# 0 A-B-C
# 1 |
# 2 D
a = (0, 0)
b = (2, 0)
c = (4, 0)
d = (2, 2)
graph = {
a: {c}, c: {a},
b: {d}, d: {b},
}
merge_corners_onto_borders(graph)
assert_equal(
graph,
{
a: {b},
b: {a, c, d},
c: {b},
d: {b},
}
)
# 01234567
# 0 A-B-C-D
# 1 | |
# 2 E F
a = (0, 0)
b = (2, 0)
c = (4, 0)
d = (6, 0)
e = (2, 2)
f = (4, 2)
graph = {
a: {d}, d: {a},
b: {e}, e: {b},
c: {f}, f: {c},
}
merge_corners_onto_borders(graph)
assert_equal(
graph,
{
a: {b},
b: {a, c, e},
c: {b, d, f},
d: {c},
e: {b},
f: {c},
}
)
def test_continue_straight_lines():
# Line ACD is joined to create line AD.
# 01234
# 0 A
# 1 |
# 2 B-C
# 3 |\
# 4 D E
a = (2, 0)
b = (0, 2)
c = (2, 2)
d = (2, 4)
e = (4, 4)
graph = {
a: {c},
b: {c},
c: {a, b, d, e},
d: {c},
e: {c},
}
continue_straight_lines(graph)
assert_equal(
graph,
{
a: {d}, d: {a},
b: {c},
c: {b, e},
e: {c},
}
)
def test_disjoint():
#this test will be stuck in an infinite loop
poly1=[(8,-16),(8,0),(0,0),(0,-8)]
poly2=[(-12,36),(0,36),(0,48),(-12,48)]
poly3=[(-12,12),(0,12),(0,-8),(-12,4)]
polys=[poly1,poly2,poly3]
graph=polygons_to_graph(polys)
merge_corners_onto_borders(graph)