def test_happy_path(self):
graph = Graph()
initial_node = gen_name()
graph.add_node(initial_node, layer=0, position=(0.5, 0.5), label='E')
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
P1().apply(graph, [initial_node])
nodes_data = graph.nodes(data=True)
self.assertEqual(len(graph.nodes()), 7)
self.assertEqual(len(graph.edges()), 13)
# check the initial node
initial_node_data = nodes_data[initial_node]
self.assertEqual(initial_node_data['layer'], 0)
self.assertEqual(initial_node_data['position'], (0.5, 0.5))
self.assertEqual(initial_node_data['label'], 'e')
# check other nodes
vx_bl = get_node_at(graph, 1, (0, 0))
vx_br = get_node_at(graph, 1, (1, 0))
vx_tl = get_node_at(graph, 1, (0, 1))
vx_tr = get_node_at(graph, 1, (1, 1))
self.assertIsNotNone(vx_bl)
self.assertIsNotNone(vx_br)
self.assertIsNotNone(vx_tl)
self.assertIsNotNone(vx_tr)
self.assertEqual(nodes_data[vx_bl]['label'], 'E')
self.assertEqual(nodes_data[vx_br]['label'], 'E')
self.assertEqual(nodes_data[vx_tl]['label'], 'E')
self.assertEqual(nodes_data[vx_tr]['label'], 'E')
vx_i1 = get_node_at(graph, 1, (2 / 3, 1 / 3))
vx_i2 = get_node_at(graph, 1, (1 / 3, 2 / 3))
self.assertIsNotNone(vx_i1)
self.assertIsNotNone(vx_i2)
self.assertEqual(nodes_data[vx_i1]['label'], 'I')
self.assertEqual(nodes_data[vx_i2]['label'], 'I')
self.assertTrue(graph.has_edge(initial_node, vx_i1))
self.assertTrue(graph.has_edge(initial_node, vx_i2))
self.assertTrue(graph.has_edge(vx_tl, vx_tr))
self.assertTrue(graph.has_edge(vx_tr, vx_br))
self.assertTrue(graph.has_edge(vx_br, vx_bl))
self.assertTrue(graph.has_edge(vx_bl, vx_tl))
self.assertTrue(graph.has_edge(vx_bl, vx_tr))
self.assertTrue(graph.has_edge(vx_i1, vx_bl))
self.assertTrue(graph.has_edge(vx_i1, vx_br))
self.assertTrue(graph.has_edge(vx_i1, vx_tr))
self.assertTrue(graph.has_edge(vx_i2, vx_bl))
self.assertTrue(graph.has_edge(vx_i2, vx_tl))
self.assertTrue(graph.has_edge(vx_i2, vx_tr))
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_integrity(self):
graph = Graph()
initial_node_name = gen_name()
graph.add_node(initial_node_name,
layer=0,
position=(0.5, 0.5),
label='E')
[i1, i2] = P1().apply(graph, [initial_node_name])
[i1_1, i1_2] = P2().apply(graph, [i1])
[i2_1, i2_2] = P2().apply(graph, [i2])
[i3_1, i3_2] = P2().apply(graph, [i1_1])
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
[i4_1, i4_2] = P2().apply(graph, [i1_2])
self.check_graph_integrity(graph, i1, 'i')
self.check_graph_integrity(graph, i2, 'i')
self.check_graph_integrity(graph, i1_1, 'i')
self.check_graph_integrity(graph, i1_2, 'i')
self.check_graph_integrity(graph, i2_1, 'I')
self.check_graph_integrity(graph, i2_2, 'I')
self.check_graph_integrity(graph, i3_1, 'I')
self.check_graph_integrity(graph, i3_2, 'I')
self.check_graph_integrity(graph, i4_1, 'I')
self.check_graph_integrity(graph, i4_2, 'I')
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def testMissingEdgeGraph(self):
for edge in required_edges():
graph = createCorrectGraph()
graph.remove_edge(edge[0], edge[1])
prod_input = [
x for x, y in graph.nodes(data=True)
if y['label'] == 'i' or y['label'] == 'I'
]
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
with self.assertRaises(ValueError):
P7().apply(graph, prod_input)
for edge in not_required_edges():
graph = createCorrectGraph()
graph.remove_edge(edge[0], edge[1])
prod_input = [
x for x, y in graph.nodes(data=True)
if y['label'] == 'i' or y['label'] == 'I'
]
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
P7().apply(graph, prod_input)
def test_incorrect_interior(self):
graph = Graph()
e1, e2, e3, e4, e5 = [gen_name() for _ in range(5)]
graph.add_node(e1, layer=1, position=(1.0, 2.0), label='I')
graph.add_node(e2, layer=1, position=(1.0, 1.5), label='E')
graph.add_node(e3, layer=1, position=(1.0, 1.0), label='E')
graph.add_node(e4, layer=1, position=(2.0, 1.0), label='E')
graph.add_node(e5, layer=1, position=(1.5, 1.5), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e2, e3)
graph.add_edge(e3, e4)
graph.add_edge(e4, e5)
graph.add_edge(e5, e1)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
with self.assertRaises(AssertionError):
P4().apply(graph, [e1])
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_different_position(self):
graph = Graph()
initial_node = gen_name()
graph.add_node(initial_node, layer=0, position=(0, 0), label='E')
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
P1().apply(graph, [initial_node],
positions=[
(0, 0),
(2, 1.5),
(1.5, 2),
(-0.5, 1.5),
])
# check other nodes
vx_bl = get_node_at(graph, 1, (0, 0))
vx_br = get_node_at(graph, 1, (2, 1.5))
vx_tl = get_node_at(graph, 1, (1.5, 2))
vx_tr = get_node_at(graph, 1, (-0.5, 1.5))
self.assertIsNotNone(vx_bl)
self.assertIsNotNone(vx_br)
self.assertIsNotNone(vx_tl)
self.assertIsNotNone(vx_tr)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_bad_input_i_label(self):
graph = Graph()
e1 = gen_name()
e2 = gen_name()
e3 = gen_name()
graph.add_node(e1, layer=1, position=(1.0, 2.0), label='E')
graph.add_node(e2, layer=1, position=(1.0, 1.0), label='E')
graph.add_node(e3, layer=1, position=(2.0, 1.0), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e1, e3)
graph.add_edge(e2, e3)
i = add_interior(graph, e1, e2, e3)
graph.nodes[i]['label'] = 'i'
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
with self.assertRaises(AssertionError):
P2().apply(graph, [i])
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_happy_path(self):
graph = Graph()
e1 = gen_name()
e2 = gen_name()
e3 = gen_name()
graph.add_node(e1, layer=1, position=(1.0, 2.0), label='E')
graph.add_node(e2, layer=1, position=(1.0, 1.0), label='E')
graph.add_node(e3, layer=1, position=(2.0, 1.0), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e1, e3)
graph.add_edge(e2, e3)
i = add_interior(graph, e1, e2, e3)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
[i1] = P9().apply(graph, [i])
# if correct number of nodes and edges
self.assertEqual(len(graph.nodes()), 8)
self.assertEqual(len(graph.edges()), 13)
# if cross-layer interior connections
self.assertEqual(graph.nodes[i]['label'], 'i')
self.assertTrue(graph.has_edge(i, i1))
# if new interior has correct label and layer
self.assertEqual(graph.nodes[i1]['label'], 'I')
self.assertEqual(graph.nodes[i1]['layer'], graph.nodes[i]['layer'] + 1)
# if new interior has 3 neighbors
i1_neighbors = get_neighbors_at(graph, i1, graph.nodes[i1]['layer'])
self.assertEqual(len(i1_neighbors), 3)
# if new nodes are in correct positions
new_e1 = get_node_at(graph, 2, (1.0, 2.0))
new_e2 = get_node_at(graph, 2, (1.0, 1.0))
new_e3 = get_node_at(graph, 2, (2.0, 1.0))
self.assertIsNotNone(new_e1)
self.assertIsNotNone(new_e2)
self.assertIsNotNone(new_e3)
# if each vertex has correct label
for n in i1_neighbors:
self.assertEqual(graph.nodes[n]['label'], 'E')
# if each vertex has correct number of neighbors
for n in i1_neighbors:
node_neighbors = get_neighbors_at(graph, n,
graph.nodes[n]['layer'])
self.assertEqual(len(node_neighbors), 3)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def testMissingNode(self):
graph = createCorrectGraph()
e5 = get_node_at(graph=graph, layer=2, pos=(2.0, 2.0))
graph.remove_node(e5)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
prod_input = [x for x, y in graph.nodes(data=True) if y['label'] == 'I']
with self.assertRaises(ValueError):
P10().apply(graph, prod_input)
def testWrongPosition(self):
graph = createCorrectGraph()
e_attributes = [y for x, y in graph.nodes(data=True) if y['label'] == 'E']
e_attributes[0]['position'] = (1.0, 4.0)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
prod_input = [x for x, y in graph.nodes(data=True) if y['label'] == 'I']
with self.assertRaises(ValueError):
P10().apply(graph, prod_input)
def testWrongLabel(self):
graph = createCorrectGraph()
attributes = [y for x, y in graph.nodes(data=True) if y['label'] == 'I']
attributes[1]['label'] = 'E'
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
prod_input = [x for x, y in graph.nodes(data=True) if y['label'] == 'I']
with self.assertRaises(ValueError):
P10().apply(graph, prod_input)
def testCorrectGraph(self):
graph = createCorrectGraph()
print(graph.nodes(data=True))
original_positions = dict(
map(lambda x: (x[0], x[1]['position']), graph.nodes(data=True)))
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
prod_input = [
x for x, y in graph.nodes(data=True)
if y['label'] == 'i' or y['label'] == 'I'
]
output = P7().apply(graph, prod_input)
self.assertEqual(len(graph.nodes()), 15)
self.assertEqual(len(graph.edges()), 35)
self.assertEqual(output, [])
for node in nodes_after_merge():
self.assertTrue(graph.has_node(node))
for node in set(required_nodes()) - set(nodes_after_merge()):
self.assertFalse(graph.has_node(node))
for edge in edges_after_merge():
self.assertTrue(graph.has_edge(edge[0], edge[1]))
for edge in set(required_edges()) - set(edges_after_merge()):
self.assertFalse(graph.has_edge(edge[0], edge[1]))
# check proper layers
upper_layer_nodes = ['e01', 'e02', 'e03', 'e04', 'i1', 'i2']
lower_layer_nodes = [
'I1', 'I2', 'I3', 'I4', 'e11', 'e12', 'e13', 'e14', 'e16'
]
upper_layer_numbers = \
list(map(lambda x: x[1]['layer'], filter(lambda x: x[0] in upper_layer_nodes, graph.nodes(data=True))))
lower_layer_numbers = \
list(map(lambda x: x[1]['layer'], filter(lambda x: x[0] in lower_layer_nodes, graph.nodes(data=True))))
self.assertEqual(len(set(upper_layer_numbers)), 1)
self.assertEqual(len(set(lower_layer_numbers)), 1)
self.assertEqual(upper_layer_numbers[0] + 1, lower_layer_numbers[0])
after_merge_positions = dict(
map(lambda x: (x[0], x[1]['position']), graph.nodes(data=True)))
for node, position in after_merge_positions.items():
self.assertTrue(position, original_positions[node])
def testCorrectGraph(self):
graph = createCorrectGraph()
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
prod_input = [
x for x, y in graph.nodes(data=True)
if y['label'] == 'i' or y['label'] == 'I'
]
[] = P6().apply(graph, prod_input)
self.assertEqual(len(graph.nodes()), 11)
self.assertEqual(len(graph.edges()), 19)
def testMissingNodeGraph(self):
graph = createCorrectGraph()
node = choice(
[x for x, y in graph.nodes(data=True) if y['label'] == 'E'])
graph.remove_node(node)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
prod_input = [
x for x, y in graph.nodes(data=True)
if y['label'] == 'i' or y['label'] == 'I'
]
with self.assertRaises(ValueError):
P6().apply(graph, prod_input)
def derive_b():
graph = Graph()
initial_node_name = gen_name()
graph.add_node(initial_node_name, layer=0, position=(0.5, 0.5), label='E')
visualize_graph_3d(graph)
pyplot.show()
[i1, i2] = P1().apply(graph, [initial_node_name])
visualize_graph_3d(graph)
pyplot.show()
[i1_1, i1_2] = P2().apply(graph, [i1], orientation=1)
[i2_1] = P9().apply(graph, [i2])
visualize_graph_3d(graph)
pyplot.show()
P10().apply(graph, [i1_1, i1_2, i2_1])
visualize_graph_3d(graph)
pyplot.show()
return graph
def test_wrong_label(self):
graph = Graph()
initial_node = gen_name()
graph.add_node(initial_node, layer=0, position=(0.5, 0.5), label='e')
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
with self.assertRaisesRegex(ValueError, 'bad label'):
P1().apply(graph, [initial_node])
self.assertEqual(len(graph.nodes()), 1)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_wrong_args(self):
graph = Graph()
initial_node = gen_name()
graph.add_node(initial_node, layer=1, position=(0.5, 0.5), label='E')
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
with self.assertRaisesRegex(ValueError, 'not enough values to unpack'):
P1().apply(graph, [])
self.assertEqual(len(graph.nodes()), 1)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_bad_input_vertex_count(self):
graph = Graph()
positions = [(1.0, 1.0), (1.0, 3.0), (2.0, 3.0), (3.0, 3.0),
(2.0, 2.0)]
[e1, e2, e23, e3, e31] = self.create_nodes(graph, 1, 'E', positions)
self.create_edges_chain(graph, [e1, e2, e23, e3, e31, e1])
i = add_interior(graph, e1, e2, e3)
with self.assertRaises(AssertionError):
[i1, i3, i2a, i2b] = P5().apply(graph, [i])
self.assertEqual(len(graph.nodes()), 6)
self.assertEqual(len(graph.edges()), 8)
if visualize_tests:
pyplot.title("Vertex missing", fontsize=16)
visualize_graph_3d(graph)
pyplot.show()
def testLargerGraph(self):
e1 = gen_name()
graph = createCorrectGraph()
prod_input = [
x for x, y in graph.nodes(data=True)
if y['label'] == 'i' or y['label'] == 'I'
]
attrs = [
y for x, y in graph.nodes(data=True)
if y['label'] == 'i' or y['label'] == 'I'
]
for node, attr in zip(prod_input, attrs):
graph = addTriangle(graph, node, attr)
[] = P6().apply(graph, prod_input)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
self.assertEqual(len(graph.nodes()), 29)
self.assertEqual(len(graph.edges()), 37)
def test_bad_input_i_label(self):
graph = Graph()
positions = [(1.0, 1.0), (1.0, 2.0), (1.0, 3.0), (2.0, 3.0),
(3.0, 3.0), (2.0, 2.0)]
[e1, e12, e2, e23, e3,
e31] = self.create_nodes(graph, 1, 'E', positions)
self.create_edges_chain(graph, [e1, e12, e2, e23, e3, e31, e1])
i = add_interior(graph, e1, e2, e3)
graph.nodes[i]['label'] = 'i'
with self.assertRaises(AssertionError):
[i1, i3, i2a, i2b] = P5().apply(graph, [i])
self.assertEqual(len(graph.nodes()), 7)
self.assertEqual(len(graph.edges()), 9)
if visualize_tests:
pyplot.title("Wrong 'i' label", fontsize=16)
visualize_graph_3d(graph)
pyplot.show()
def test_bad_input_vertex_count(self):
graph = Graph()
e1 = gen_name()
e2 = gen_name()
e3 = gen_name()
graph.add_node(e1, layer=1, position=(1.0, 2.0), label='I')
graph.add_node(e2, layer=1, position=(1.0, 1.0), label='E')
graph.add_node(e3, layer=1, position=(2.0, 1.0), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e1, e3)
graph.add_edge(e2, e3)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
with self.assertRaises(AssertionError):
P2().apply(graph, [e1])
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_happy_path(self):
graph = Graph()
e1 = gen_name()
e2 = gen_name()
e3 = gen_name()
graph.add_node(e1, layer=0, position=(1.0, 2.0), label='E')
graph.add_node(e2, layer=0, position=(1.0, 1.0), label='E')
graph.add_node(e3, layer=0, position=(2.0, 1.0), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e1, e3)
graph.add_edge(e2, e3)
i = add_interior(graph, e1, e2, e3)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
[i1, i2] = P2().apply(graph, [i])
self.assertIsNotNone(get_node_at(graph, 1, (1.0, 2.0)))
self.assertIsNotNone(get_node_at(graph, 1, (1.0, 1.0)))
self.assertIsNotNone(get_node_at(graph, 1, (2.0, 1.0)))
self.assertIsNotNone(get_node_at(graph, 1, (1.5, 1.0)))
(i1_x, i1_y) = graph.nodes[i1]['position']
(i2_x, i2_y) = graph.nodes[i2]['position']
self.assertTrue(isclose(i1_x, 1.166666, rel_tol=eps))
self.assertTrue(isclose(i1_y, 1.333333, rel_tol=eps))
self.assertTrue(isclose(i2_x, 1.5, rel_tol=eps))
self.assertTrue(isclose(i2_y, 1.333333, rel_tol=eps))
self.assertEqual(len(graph.nodes()), 10)
self.assertEqual(len(graph.edges()), 19)
self.assertEqual(graph.nodes[i]['label'], 'i')
self.assertTrue(graph.has_edge(i, i1))
self.assertTrue(graph.has_edge(i, i2))
self.assertEqual(graph.nodes[i1]['label'], 'I')
self.assertEqual(graph.nodes[i2]['label'], 'I')
self.assertEqual(graph.nodes[i1]['layer'], graph.nodes[i]['layer'] + 1)
self.assertEqual(graph.nodes[i2]['layer'], graph.nodes[i]['layer'] + 1)
i1_neighbors = get_neighbors_at(graph, i1, graph.nodes[i1]['layer'])
self.assertEqual(len(i1_neighbors), 3)
i2_neighbors = get_neighbors_at(graph, i2, graph.nodes[i2]['layer'])
self.assertEqual(len(i2_neighbors), 3)
common_neighbors = [x for x in i1_neighbors if x in i2_neighbors]
for n in i1_neighbors:
if n not in common_neighbors:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])),
3)
for n in i2_neighbors:
if n not in common_neighbors:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
len(get_neighbors_at(graph, n, graph.nodes[i2]['layer'])),
3)
for c_neighbor in common_neighbors:
self.assertEqual(graph.nodes[c_neighbor]['label'], 'E')
self.assertEqual(
len(
get_neighbors_at(graph, c_neighbor,
graph.nodes[i1]['layer'])), 5)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def testHappyPath(self):
graph = createCorrectGraph()
prod_input = [x for x, y in graph.nodes(data=True) if y['label'] == 'I']
P10().apply(graph, prod_input)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
#test if number of nodes and edges is correct
self.assertEqual(len(graph.nodes()), 10)
self.assertEqual(len(graph.edges()), 16)
e1 = get_node_at(graph=graph, layer=1, pos=(1.0, 2.0))
e2 = get_node_at(graph=graph, layer=1, pos=(3.0, 2.0))
i1 = get_node_at(graph=graph, layer=1, pos=(2.0, 3.0))
i2 = get_node_at(graph=graph, layer=1, pos=(2.0, 1.0))
I1 = get_node_at(graph=graph, layer=2, pos=(1.5, 3.5))
I2 = get_node_at(graph=graph, layer=2, pos=(2.5, 3.5))
e3 = get_node_at(graph=graph, layer=2, pos=(1.0, 2.0))
e4 = get_node_at(graph=graph, layer=2, pos=(3.0, 2.0))
e5 = get_node_at(graph=graph, layer=2, pos=(2.0, 2.0))
I3 = get_node_at(graph=graph, layer=2, pos=(2.5, 0.5))
#check position
self.assertIsNotNone(e1)
self.assertIsNotNone(e2)
self.assertIsNotNone(i1)
self.assertIsNotNone(i2)
self.assertIsNotNone(I1)
self.assertIsNotNone(I2)
self.assertIsNotNone(e3)
self.assertIsNotNone(e4)
self.assertIsNotNone(e5)
self.assertIsNotNone(I3)
#check edges
# upper layer edges
self.assertTrue(graph.has_edge(e1, i1))
self.assertTrue(graph.has_edge(e1, i2))
self.assertTrue(graph.has_edge(e2, i1))
self.assertTrue(graph.has_edge(e2, i2))
self.assertTrue(graph.has_edge(e1, e2))
# interlayer connections
self.assertTrue(graph.has_edge(I1, i1))
self.assertTrue(graph.has_edge(I2, i1))
self.assertTrue(graph.has_edge(I3, i2))
# lower layer connections
self.assertTrue(graph.has_edge(I1, e3))
self.assertTrue(graph.has_edge(I1, e5))
self.assertTrue(graph.has_edge(e3, e5))
self.assertTrue(graph.has_edge(I2, e4))
self.assertTrue(graph.has_edge(I2, e5))
self.assertTrue(graph.has_edge(e4, e5))
self.assertTrue(graph.has_edge(I3, e3))
self.assertTrue(graph.has_edge(I3, e4))
#check labels
self.assertEqual(graph.nodes[e1]['label'], 'E')
self.assertEqual(graph.nodes[e2]['label'], 'E')
self.assertEqual(graph.nodes[i1]['label'], 'i')
self.assertEqual(graph.nodes[i2]['label'], 'i')
self.assertEqual(graph.nodes[I1]['label'], 'I')
self.assertEqual(graph.nodes[I2]['label'], 'I')
self.assertEqual(graph.nodes[e3]['label'], 'E')
self.assertEqual(graph.nodes[e4]['label'], 'E')
self.assertEqual(graph.nodes[e5]['label'], 'E')
self.assertEqual(graph.nodes[I3]['label'], 'I')
def testOnBiggerGraph(self):
graph = Graph()
initial_node_name = gen_name()
graph.add_node(initial_node_name, layer=0, position=(0.5, 0.5), label='E')
[i1, i2] = P1().apply(graph, [initial_node_name])
[i1_1, i1_2] = P2().apply(graph, [i1], orientation=1)
[i2_1] = P9().apply(graph, [i2], orientation=1)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
[i1_1new, i1_2new, i2_1new] = P10().apply(graph, [i1_1, i1_2, i2_1])
self.assertEqual(len(graph.nodes()), 15)
self.assertEqual(len(graph.edges()), 32)
e = get_node_at(graph=graph, layer=0, pos=(0.5, 0.5))
e1 = get_node_at(graph=graph, layer=1, pos=(0.0, 0.0))
e2 = get_node_at(graph=graph, layer=1, pos=(1.0, 0.0))
e3 = get_node_at(graph=graph, layer=1, pos=(1.0, 1.0))
e4 = get_node_at(graph=graph, layer=1, pos=(0.0, 1.0))
e5 = get_node_at(graph=graph, layer=2, pos=(0.0, 0.0))
e6 = get_node_at(graph=graph, layer=2, pos=(1.0, 0.0))
e7 = get_node_at(graph=graph, layer=2, pos=(1.0, 1.0))
e8 = get_node_at(graph=graph, layer=2, pos=(0.0, 1.0))
e9 = get_node_at(graph=graph, layer=2, pos=(0.5, 0.5))
# check position
self.assertIsNotNone(e)
self.assertIsNotNone(e1)
self.assertIsNotNone(e2)
self.assertIsNotNone(e3)
self.assertIsNotNone(e4)
self.assertIsNotNone(e5)
self.assertIsNotNone(e6)
self.assertIsNotNone(e7)
self.assertIsNotNone(e8)
self.assertIsNotNone(e9)
self.assertEqual(graph.nodes[i1_1new]['position'], graph.nodes[i1_1]['position'])
self.assertEqual(graph.nodes[i1_2new]['position'], graph.nodes[i1_2]['position'])
self.assertEqual(graph.nodes[i2_1new]['position'], graph.nodes[i2]['position']) # ten co jest z prawe
self.assertEqual(graph.nodes[i1_1new]['layer'], graph.nodes[i1_1]['layer'])
self.assertEqual(graph.nodes[i1_2new]['layer'], graph.nodes[i1_2]['layer'])
self.assertEqual(graph.nodes[i2_1new]['layer'], graph.nodes[i2_1]['layer'])
i1_new = get_node_at(graph=graph, layer=1, pos=graph.nodes[i1]['position'])
i2_new = get_node_at(graph=graph, layer=1, pos=graph.nodes[i2]['position'])
self.assertIsNotNone(i1_new)
self.assertIsNotNone(i2_new)
# zero
self.assertTrue(graph.has_edge(e, i1_new))
self.assertTrue(graph.has_edge(e, i2_new))
# first
self.assertTrue(graph.has_edge(e1, e2))
self.assertTrue(graph.has_edge(e1, e3))
self.assertTrue(graph.has_edge(e1, e4))
self.assertTrue(graph.has_edge(e1, i2_new))
self.assertTrue(graph.has_edge(e1, i1_new))
self.assertTrue(graph.has_edge(e2, e3))
self.assertTrue(graph.has_edge(e2, i2_new))
self.assertTrue(graph.has_edge(e3, e4))
self.assertTrue(graph.has_edge(e3, i1_new))
self.assertTrue(graph.has_edge(e3, i2_new))
self.assertTrue(graph.has_edge(e4, i1_new))
# second
self.assertTrue(graph.has_edge(e5, e6))
self.assertTrue(graph.has_edge(e5, e9))
self.assertTrue(graph.has_edge(e5, e8))
self.assertTrue(graph.has_edge(e6, e7))
self.assertTrue(graph.has_edge(e7, e9))
self.assertTrue(graph.has_edge(e7, e8))
self.assertTrue(graph.has_edge(i1_new, i1_1new))
self.assertTrue(graph.has_edge(i1_new, i1_2new))
self.assertTrue(graph.has_edge(i2_new, i2_1new))
self.assertTrue(graph.has_edge(e5, i1_1new))
self.assertTrue(graph.has_edge(e8, i1_1new))
self.assertTrue(graph.has_edge(e9, i1_1new))
self.assertTrue(graph.has_edge(e7, i1_2new))
self.assertTrue(graph.has_edge(e8, i1_2new))
self.assertTrue(graph.has_edge(e9, i1_2new))
self.assertTrue(graph.has_edge(e5, i2_1new))
self.assertTrue(graph.has_edge(e6, i2_1new))
self.assertTrue(graph.has_edge(e7, i2_1new))
# check labels
self.assertEqual(graph.nodes[e]['label'], 'e')
self.assertEqual(graph.nodes[e1]['label'], 'E')
self.assertEqual(graph.nodes[e2]['label'], 'E')
self.assertEqual(graph.nodes[e3]['label'], 'E')
self.assertEqual(graph.nodes[e4]['label'], 'E')
self.assertEqual(graph.nodes[e5]['label'], 'E')
self.assertEqual(graph.nodes[e6]['label'], 'E')
self.assertEqual(graph.nodes[e7]['label'], 'E')
self.assertEqual(graph.nodes[e8]['label'], 'E')
self.assertEqual(graph.nodes[e9]['label'], 'E')
self.assertEqual(graph.nodes[i1_1new]['label'], 'I')
self.assertEqual(graph.nodes[i1_2new]['label'], 'I')
self.assertEqual(graph.nodes[i2_1new]['label'], 'I')
self.assertEqual(graph.nodes[i1_new]['label'], 'i')
self.assertEqual(graph.nodes[i2_new]['label'], 'i')
def test_happy_path(self):
graph = Graph()
e1 = gen_name()
e2 = gen_name()
e3 = gen_name()
e4 = gen_name()
e1_1 = gen_name()
e1_2 = gen_name()
e1_3 = gen_name()
e2_1 = gen_name()
e2_2 = gen_name()
e2_4 = gen_name()
e3_5 = gen_name()
graph.add_node(e1, layer=1, position=(1.0, 1.0), label='E')
graph.add_node(e2, layer=1, position=(2.0, 2.0), label='E')
graph.add_node(e3, layer=1, position=(1.0, 2.0), label='E')
graph.add_node(e4, layer=1, position=(2.0, 1.0), label='E')
graph.add_node(e1_1, layer=2, position=(1.0, 1.0), label='E')
graph.add_node(e1_2, layer=2, position=(2.0, 2.0), label='E')
graph.add_node(e1_3, layer=2, position=(1.0, 2.0), label='E')
graph.add_node(e2_1, layer=2, position=(1.0, 1.0), label='E')
graph.add_node(e2_2, layer=2, position=(2.0, 2.0), label='E')
graph.add_node(e2_4, layer=2, position=(2.0, 1.0), label='E')
graph.add_node(e3_5, layer=2, position=(2.0, 3.0), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e1, e3)
graph.add_edge(e1, e4)
graph.add_edge(e2, e3)
graph.add_edge(e2, e4)
graph.add_edge(e1_1, e1_2)
graph.add_edge(e1_1, e1_3)
graph.add_edge(e1_2, e1_3)
graph.add_edge(e2_1, e2_2)
graph.add_edge(e2_1, e2_4)
graph.add_edge(e2_2, e2_4)
graph.add_edge(e3_5, e1_2)
graph.add_edge(e3_5, e1_3)
i1 = add_interior(graph, e1, e2, e3)
i2 = add_interior(graph, e1, e2, e4)
i1_1 = add_interior(graph, e1_1, e1_2, e1_3)
i2_1 = add_interior(graph, e2_1, e2_2, e2_4)
i3_1 = add_interior(graph, e3_5, e1_2, e1_3)
graph.nodes[i1]['label'] = 'i'
graph.nodes[i2]['label'] = 'i'
graph.add_edge(i1, i1_1)
graph.add_edge(i2, i2_1)
graph.add_edge(i1, i3_1)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
P12().apply(graph, [i1, i2, i1_1, i2_1])
# if correct number of nodes and edges
self.assertEqual(len(graph.nodes()), 14)
self.assertEqual(len(graph.edges()), 30)
# if interiors has correct labels, layers and are connected
self.assertEqual(graph.nodes[i1]['label'], 'i')
self.assertEqual(graph.nodes[i2]['label'], 'i')
self.assertEqual(graph.nodes[i1_1]['label'], 'I')
self.assertEqual(graph.nodes[i2_1]['label'], 'I')
self.assertEqual(graph.nodes[i1]['layer'], 1)
self.assertEqual(graph.nodes[i2]['layer'], 1)
self.assertEqual(graph.nodes[i1_1]['layer'], 2)
self.assertEqual(graph.nodes[i2_1]['layer'], 2)
self.assertTrue(graph.has_edge(i1, i1_1))
self.assertTrue(graph.has_edge(i2, i2_1))
# if each interior has 3 neighbors
i1_neighbors = get_neighbors_at(graph, i1, graph.nodes[i1]['layer'])
self.assertEqual(len(i1_neighbors), 3)
i2_neighbors = get_neighbors_at(graph, i2, graph.nodes[i2]['layer'])
self.assertEqual(len(i2_neighbors), 3)
i1_1_neighbors = get_neighbors_at(graph, i1_1,
graph.nodes[i1_1]['layer'])
self.assertEqual(len(i1_1_neighbors), 3)
i2_1_neighbors = get_neighbors_at(graph, i2_1,
graph.nodes[i2_1]['layer'])
self.assertEqual(len(i2_1_neighbors), 3)
# if nodes in lower layer exists and are correctly connected
new_e1 = get_node_at(graph, 2, (1.0, 1.0))
new_e2 = get_node_at(graph, 2, (2.0, 2.0))
new_e3 = get_node_at(graph, 2, (1.0, 2.0))
new_e4 = get_node_at(graph, 2, (2.0, 1.0))
self.assertIsNotNone(new_e1)
self.assertIsNotNone(new_e2)
self.assertIsNotNone(new_e3)
self.assertIsNotNone(new_e4)
self.assertTrue(graph.has_edge(new_e1, new_e2))
self.assertTrue(graph.has_edge(new_e1, new_e3))
self.assertTrue(graph.has_edge(new_e1, new_e4))
self.assertTrue(graph.has_edge(new_e2, new_e3))
self.assertTrue(graph.has_edge(new_e2, new_e4))
# if lower interiors connect with all 4 vertices
all_neighbors = i1_1_neighbors + i2_1_neighbors
all_neighbors = list(dict.fromkeys(all_neighbors)) # remove duplicates
self.assertEqual(len(all_neighbors), 4)
# if each vertex has correct label
for n in all_neighbors:
self.assertEqual(graph.nodes[n]['label'], 'E')
# if each vertex has correct number of neighbors (based on neighbour interiors count)
for n in all_neighbors:
node_neighbors = get_neighbors_at(graph, n,
graph.nodes[n]['layer'])
i_neighbors = [
x for x in node_neighbors if graph.nodes[x]['label'] == 'I'
]
if len(i_neighbors) == 1:
self.assertEqual(len(node_neighbors), 3)
elif len(i_neighbors) == 2:
self.assertEqual(len(node_neighbors), 5)
else:
self.assertEqual(len(node_neighbors), 7)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_risky_triangle_break(self):
graph = Graph()
e1, e2, e3, e4, e5 = [gen_name() for _ in range(5)]
e6 = gen_name()
graph.add_node(e1, layer=1, position=(1.0, 2.0), label='E')
graph.add_node(e2, layer=1, position=(1.0, 1.5), label='E')
graph.add_node(e3, layer=1, position=(1.0, 1.0), label='E')
graph.add_node(e4, layer=1, position=(2.0, 1.0), label='E')
graph.add_node(e5, layer=1, position=(1.5, 1.5), label='E')
graph.add_node(e6, layer=1, position=(0.0, 1.5), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e2, e3)
graph.add_edge(e3, e4)
graph.add_edge(e4, e5)
graph.add_edge(e5, e1)
graph.add_edge(e1, e6)
graph.add_edge(e6, e3)
i = add_interior(graph, e1, e3, e4)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
[i1, i2, i3] = P4().apply(graph, [i])
self.assertEqual(len(graph.nodes()), 15)
self.assertEqual(len(graph.edges()), 29)
self.assertEqual(graph.nodes[i]['label'], 'i')
self.assertTrue(graph.has_edge(i, i1))
self.assertTrue(graph.has_edge(i, i2))
self.assertTrue(graph.has_edge(i, i3))
self.assertEqual(graph.nodes[i1]['label'], 'I')
self.assertEqual(graph.nodes[i2]['label'], 'I')
self.assertEqual(graph.nodes[i3]['label'], 'I')
self.assertEqual(graph.nodes[i1]['layer'], graph.nodes[i]['layer'] + 1)
self.assertEqual(graph.nodes[i2]['layer'], graph.nodes[i]['layer'] + 1)
self.assertEqual(graph.nodes[i3]['layer'], graph.nodes[i]['layer'] + 1)
i1_neighbors = get_neighbors_at(graph, i1, graph.nodes[i1]['layer'])
self.assertEqual(len(i1_neighbors), 3)
i2_neighbors = get_neighbors_at(graph, i2, graph.nodes[i2]['layer'])
self.assertEqual(len(i2_neighbors), 3)
i3_neighbors = get_neighbors_at(graph, i3, graph.nodes[i3]['layer'])
self.assertEqual(len(i3_neighbors), 3)
i1_i2_n = [x for x in i1_neighbors if x in i2_neighbors]
i1_i3_n = [x for x in i1_neighbors if x in i3_neighbors]
i2_i3_n = [x for x in i2_neighbors if x in i3_neighbors]
# Test i1-only neighbors
for n in [
x for x in i1_neighbors
if x not in i1_i2_n and x not in i1_i3_n
]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
3, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
# Test i2-only neighbors
for n in [
x for x in i2_neighbors
if x not in i1_i2_n and x not in i2_i3_n
]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
3, len(get_neighbors_at(graph, n, graph.nodes[i2]['layer'])))
# Test i3-only neighbors
for n in [
x for x in i3_neighbors
if x not in i1_i3_n and x not in i2_i3_n
]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
3, len(get_neighbors_at(graph, n, graph.nodes[i3]['layer'])))
# Test nodes connected to 2 interiors
for n in [x for x in i1_i2_n if x not in i1_i3_n and x not in i2_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
5, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
for n in [x for x in i1_i3_n if x not in i1_i2_n and x not in i2_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
5, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
for n in [x for x in i2_i3_n if x not in i1_i2_n and x not in i1_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
5, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
# Test nodes connected to 3 interiors
for n in [x for x in i2_i3_n if x in i1_i2_n and x in i1_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
7, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
def test_in_bigger_graph(self):
graph = Graph()
# Base nodes
e1, e2, e3, e4, e5 = [gen_name() for _ in range(5)]
# Additional nodes
e6, e7, e8, e9 = [gen_name() for _ in range(4)]
graph.add_node(e1, layer=1, position=(1.0, 2.0), label='E')
graph.add_node(e2, layer=1, position=(1.0, 1.5), label='E')
graph.add_node(e3, layer=1, position=(1.0, 1.0), label='E')
graph.add_node(e4, layer=1, position=(2.0, 1.0), label='E')
graph.add_node(e5, layer=1, position=(1.5, 1.5), label='E')
graph.add_node(e6, layer=1, position=(2.0, 2.0), label='E')
graph.add_node(e7, layer=1, position=(1.0, 0.0), label='E')
graph.add_node(e8, layer=1, position=(2.0, 0.0), label='E')
graph.add_node(e9, layer=1, position=(1.5, -1.0), label='E')
graph.add_edge(e1, e2)
graph.add_edge(e2, e3)
graph.add_edge(e3, e4)
graph.add_edge(e4, e5)
graph.add_edge(e5, e1)
graph.add_edge(e1, e6)
graph.add_edge(e6, e5)
graph.add_edge(e7, e3)
graph.add_edge(e7, e8)
graph.add_edge(e7, e9)
graph.add_edge(e8, e4)
graph.add_edge(e8, e9)
I = add_interior(graph, e1, e3, e4)
I1 = add_interior(graph, e1, e5, e6)
I2 = add_interior(graph, e7, e8, e4)
I3 = add_interior(graph, e7, e8, e9)
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
[i1, i2, i3] = P4().apply(graph, [I])
self.assertEqual(len(graph.nodes()), 21)
self.assertEqual(len(graph.edges()), 43)
self.assertEqual(graph.nodes[I]['label'], 'i')
self.assertTrue(graph.has_edge(I, i1))
self.assertTrue(graph.has_edge(I, i2))
self.assertTrue(graph.has_edge(I, i3))
self.assertEqual(graph.nodes[i1]['label'], 'I')
self.assertEqual(graph.nodes[i2]['label'], 'I')
self.assertEqual(graph.nodes[i3]['label'], 'I')
self.assertEqual(graph.nodes[i1]['layer'], graph.nodes[I]['layer'] + 1)
self.assertEqual(graph.nodes[i2]['layer'], graph.nodes[I]['layer'] + 1)
self.assertEqual(graph.nodes[i3]['layer'], graph.nodes[I]['layer'] + 1)
i1_neighbors = get_neighbors_at(graph, i1, graph.nodes[i1]['layer'])
self.assertEqual(len(i1_neighbors), 3)
i2_neighbors = get_neighbors_at(graph, i2, graph.nodes[i2]['layer'])
self.assertEqual(len(i2_neighbors), 3)
i3_neighbors = get_neighbors_at(graph, i3, graph.nodes[i3]['layer'])
self.assertEqual(len(i3_neighbors), 3)
i1_i2_n = [x for x in i1_neighbors if x in i2_neighbors]
i1_i3_n = [x for x in i1_neighbors if x in i3_neighbors]
i2_i3_n = [x for x in i2_neighbors if x in i3_neighbors]
# Test i1-only neighbors
for n in [
x for x in i1_neighbors
if x not in i1_i2_n and x not in i1_i3_n
]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
3, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
# Test i2-only neighbors
for n in [
x for x in i2_neighbors
if x not in i1_i2_n and x not in i2_i3_n
]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
3, len(get_neighbors_at(graph, n, graph.nodes[i2]['layer'])))
# Test i3-only neighbors
for n in [
x for x in i3_neighbors
if x not in i1_i3_n and x not in i2_i3_n
]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
3, len(get_neighbors_at(graph, n, graph.nodes[i3]['layer'])))
# Test nodes connected to 2 interiors
for n in [x for x in i1_i2_n if x not in i1_i3_n and x not in i2_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
5, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
for n in [x for x in i1_i3_n if x not in i1_i2_n and x not in i2_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
5, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
for n in [x for x in i2_i3_n if x not in i1_i2_n and x not in i1_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
5, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
# Test nodes connected to 3 interiors
for n in [x for x in i2_i3_n if x in i1_i2_n and x in i1_i3_n]:
self.assertEqual(graph.nodes[n]['label'], 'E')
self.assertEqual(
7, len(get_neighbors_at(graph, n, graph.nodes[i1]['layer'])))
if visualize_tests:
visualize_graph_3d(graph)
pyplot.show()
P12().apply(g, [i44, i45, new_i44, new_i45])
P12().apply(g, [i46, i47, new_i46, new_i47])
[i52, i51] = P2().apply(g, [f1], orientation=1)
[i54, i53] = P2().apply(g, [f2], orientation=1)
[i56, i55] = P2().apply(g, [f3], orientation=1)
[i58, i57] = P2().apply(g, [f4], orientation=1)
P12().apply(g, [i41, f1, new_i41, i51])
P12().apply(g, [i43, f2, new_i43, i53])
P12().apply(g, [i45, f3, new_i45, i55])
P12().apply(g, [i47, f4, new_i47, i57])
P13().apply(g, [i22, i23, new_i22, new_i23])
P13().apply(g, [i23, i24, new_i23, new_i24])
P13().apply(g, [i24, i25, new_i24, new_i25])
P13().apply(g, [i11, i12, new_i11, new_i12])
P13().apply(g, [i42, f1, new_i42, i52])
P13().apply(g, [i44, f2, new_i44, i54])
P13().apply(g, [i46, f3, new_i46, i56])
P13().apply(g, [i48, f4, new_i48, i58])
return g
if __name__ == '__main__':
graph = derive_e()
visualize_graph_3d(graph)
pyplot.show()
visualize_graph_layer(graph, 7)
pyplot.show()
def test_parent_graph(self):
graph = Graph()
positions = [(1.0, 1.0), (1.0, 9.0), (9.0, 1.0), (9.0, 9.0),
(5.0, 5.0), (3.0, 7.0), (7.0, 7.0), (6.0, 6.0),
(4.0, 8.0)]
[e0a, e1, e0b, e0c, e2, e12, e3, e23,
e31] = self.create_nodes(graph, 1, 'E', positions)
self.create_edges_chain(graph, [e0a, e1, e12, e0a, e2, e12])
self.create_edges_chain(graph, [e0a, e0b, e2, e23, e0b, e3, e23])
self.create_edges_chain(graph, [e0b, e0c, e3, e31, e0c, e1, e31])
i_0a_1_12 = add_interior(graph, e0a, e1, e12)
i_0a_12_2 = add_interior(graph, e0a, e12, e2)
i_0a_0b_2 = add_interior(graph, e0a, e0b, e2)
i_0b_2_23 = add_interior(graph, e0b, e2, e23)
i_0b_23_3 = add_interior(graph, e0b, e23, e3)
i_0b_0c_3 = add_interior(graph, e0b, e3, e0c)
i_0c_1_31 = add_interior(graph, e1, e31, e0c)
i_0c_3_31 = add_interior(graph, e31, e3, e0c)
i = add_interior(graph, e1, e2, e3)
if visualize_tests:
pyplot.title("Correct subgraph input", fontsize=16)
visualize_graph_layer(graph, 1)
pyplot.show()
[i1, i3, i2a, i2b] = P5().apply(graph, [i])
if visualize_tests:
pyplot.title("Correct subgraph output", fontsize=16)
visualize_graph_3d(graph)
pyplot.show()
pyplot.title("Correct subgraph output (layer=1)", fontsize=16)
visualize_graph_layer(graph, 1)
pyplot.show()
pyplot.title("Correct subgraph output (layer=2)", fontsize=16)
visualize_graph_layer(graph, 2)
pyplot.show()
# if edges are unchanged
self.assertTrue(graph.has_edge(e0a, e1))
self.assertTrue(graph.has_edge(e1, e12))
self.assertTrue(graph.has_edge(e12, e0a))
self.assertTrue(graph.has_edge(e0a, e2))
self.assertTrue(graph.has_edge(e2, e12))
self.assertTrue(graph.has_edge(e0a, e0b))
self.assertTrue(graph.has_edge(e0b, e2))
self.assertTrue(graph.has_edge(e2, e23))
self.assertTrue(graph.has_edge(e23, e0b))
self.assertTrue(graph.has_edge(e0b, e3))
self.assertTrue(graph.has_edge(e3, e23))
self.assertTrue(graph.has_edge(e0b, e0c))
self.assertTrue(graph.has_edge(e0c, e3))
self.assertTrue(graph.has_edge(e3, e31))
self.assertTrue(graph.has_edge(e31, e0c))
self.assertTrue(graph.has_edge(e0c, e1))
self.assertTrue(graph.has_edge(e1, e31))
# if interior links are unchanged
self.assertTrue(graph.has_edge(i, e1))
self.assertTrue(graph.has_edge(i, e2))
self.assertTrue(graph.has_edge(i, e3))
self.assertTrue(graph.has_edge(i_0a_1_12, e0a))
self.assertTrue(graph.has_edge(i_0a_1_12, e1))
self.assertTrue(graph.has_edge(i_0a_1_12, e12))
self.assertTrue(graph.has_edge(i_0a_12_2, e0a))
self.assertTrue(graph.has_edge(i_0a_12_2, e12))
self.assertTrue(graph.has_edge(i_0a_12_2, e2))
self.assertTrue(graph.has_edge(i_0a_0b_2, e0a))
self.assertTrue(graph.has_edge(i_0a_0b_2, e0b))
self.assertTrue(graph.has_edge(i_0a_0b_2, e2))
self.assertTrue(graph.has_edge(i_0b_2_23, e0b))
self.assertTrue(graph.has_edge(i_0b_2_23, e2))
self.assertTrue(graph.has_edge(i_0b_2_23, e23))
self.assertTrue(graph.has_edge(i_0b_23_3, e0b))
self.assertTrue(graph.has_edge(i_0b_23_3, e23))
self.assertTrue(graph.has_edge(i_0b_23_3, e3))
self.assertTrue(graph.has_edge(i_0b_0c_3, e0b))
self.assertTrue(graph.has_edge(i_0b_0c_3, e3))
self.assertTrue(graph.has_edge(i_0b_0c_3, e0c))
self.assertTrue(graph.has_edge(i_0c_1_31, e1))
self.assertTrue(graph.has_edge(i_0c_1_31, e31))
self.assertTrue(graph.has_edge(i_0c_1_31, e0c))
self.assertTrue(graph.has_edge(i_0c_3_31, e31))
self.assertTrue(graph.has_edge(i_0c_3_31, e3))
self.assertTrue(graph.has_edge(i_0c_3_31, e0c))
# if vertex labels are unchanged
self.assertEqual(graph.nodes[e0a]['label'], 'E')
self.assertEqual(graph.nodes[e1]['label'], 'E')
self.assertEqual(graph.nodes[e0b]['label'], 'E')
self.assertEqual(graph.nodes[e0c]['label'], 'E')
self.assertEqual(graph.nodes[e2]['label'], 'E')
self.assertEqual(graph.nodes[e12]['label'], 'E')
self.assertEqual(graph.nodes[e3]['label'], 'E')
self.assertEqual(graph.nodes[e23]['label'], 'E')
self.assertEqual(graph.nodes[e31]['label'], 'E')
# if number of neighbors is unchanged
# if each vertex has correct number of neighbors (based on neighbour interiors count)
for n in [e0a, e1, e0b, e0c, e2, e12, e3, e23, e31]:
node_neighbors = get_neighbors_at(graph, n,
graph.nodes[n]['layer'])
i_neighbors = [
x for x in node_neighbors if graph.nodes[x]['label'] == 'I'
or graph.nodes[x]['label'] == 'i'
]
e_neighbors = [
x for x in node_neighbors if graph.nodes[x]['label'] == 'E'
or graph.nodes[x]['label'] == 'e'
]
if len(e_neighbors) == len(i_neighbors):
self.assertEqual(len(node_neighbors), len(i_neighbors) * 2)
else:
self.assertEqual(len(node_neighbors),
(len(i_neighbors) * 2) + 1)
# if vertices position is unchanged
self.assertEqual(graph.nodes[e0a]['position'], (1.0, 1.0))
self.assertEqual(graph.nodes[e1]['position'], (1.0, 9.0))
self.assertEqual(graph.nodes[e0b]['position'], (9.0, 1.0))
self.assertEqual(graph.nodes[e0c]['position'], (9.0, 9.0))
self.assertEqual(graph.nodes[e2]['position'], (5.0, 5.0))
self.assertEqual(graph.nodes[e12]['position'], (3.0, 7.0))
self.assertEqual(graph.nodes[e3]['position'], (7.0, 7.0))
self.assertEqual(graph.nodes[e23]['position'], (6.0, 6.0))
self.assertEqual(graph.nodes[e31]['position'], (4.0, 8.0))
def test_happy_path(self):
graph = Graph()
positions = [(1.0, 1.0), (1.0, 2.0), (1.0, 3.0), (2.0, 3.0),
(3.0, 3.0), (2.0, 2.0)]
[e1, e12, e2, e23, e3,
e31] = self.create_nodes(graph, 1, 'E', positions)
self.create_edges_chain(graph, [e1, e12, e2, e23, e3, e31, e1])
i = add_interior(graph, e1, e2, e3)
if visualize_tests:
pyplot.title("Correct input", fontsize=16)
visualize_graph_3d(graph)
pyplot.show()
[i1, i3, i2a, i2b] = P5().apply(graph, [i])
if visualize_tests:
pyplot.title("Correct output", fontsize=16)
visualize_graph_3d(graph)
pyplot.show()
pyplot.title("Correct output (layer = 1)", fontsize=16)
visualize_graph_layer(graph, 1)
pyplot.show()
pyplot.title("Correct output (layer = 2)", fontsize=16)
visualize_graph_layer(graph, 2)
pyplot.show()
# if correct number of nodes and edges
self.assertEqual(len(graph.nodes()), 17)
self.assertEqual(len(graph.edges()), 34)
# if cross-layer interior connections
self.assertEqual(graph.nodes[i]['label'], 'i')
self.assertTrue(graph.has_edge(i, i1))
self.assertTrue(graph.has_edge(i, i3))
self.assertTrue(graph.has_edge(i, i2a))
self.assertTrue(graph.has_edge(i, i2b))
# if new interiors has correct labels and layers
self.assertEqual(graph.nodes[i1]['label'], 'I')
self.assertEqual(graph.nodes[i3]['label'], 'I')
self.assertEqual(graph.nodes[i2a]['label'], 'I')
self.assertEqual(graph.nodes[i2b]['label'], 'I')
self.assertEqual(graph.nodes[i1]['layer'], graph.nodes[i]['layer'] + 1)
self.assertEqual(graph.nodes[i3]['layer'], graph.nodes[i]['layer'] + 1)
self.assertEqual(graph.nodes[i2a]['layer'],
graph.nodes[i]['layer'] + 1)
self.assertEqual(graph.nodes[i2b]['layer'],
graph.nodes[i]['layer'] + 1)
# if each new interior has 3 neighbors
i1_neighbors = get_neighbors_at(graph, i1, graph.nodes[i1]['layer'])
self.assertEqual(len(i1_neighbors), 3)
i3_neighbors = get_neighbors_at(graph, i3, graph.nodes[i3]['layer'])
self.assertEqual(len(i3_neighbors), 3)
i2a_neighbors = get_neighbors_at(graph, i2a, graph.nodes[i2a]['layer'])
self.assertEqual(len(i2a_neighbors), 3)
i2b_neighbors = get_neighbors_at(graph, i2b, graph.nodes[i2b]['layer'])
self.assertEqual(len(i2b_neighbors), 3)
# if new nodes are in correct positions
new_e1 = get_node_at(graph, 2, (1.0, 1.0))
new_e12 = get_node_at(graph, 2, (1.0, 2.0))
new_e2 = get_node_at(graph, 2, (1.0, 3.0))
new_e23 = get_node_at(graph, 2, (2.0, 3.0))
new_e3 = get_node_at(graph, 2, (3.0, 3.0))
new_e31 = get_node_at(graph, 2, (2.0, 2.0))
self.assertIsNotNone(new_e1)
self.assertIsNotNone(new_e12)
self.assertIsNotNone(new_e2)
self.assertIsNotNone(new_e23)
self.assertIsNotNone(new_e3)
self.assertIsNotNone(new_e31)
# if interiors connect with all new 6 vertices
all_neighbors = i1_neighbors + i3_neighbors + i2a_neighbors + i2b_neighbors
all_neighbors = list(dict.fromkeys(all_neighbors)) # remove duplicates
self.assertEqual(len(all_neighbors), 6)
# if each vertex has correct label
for n in all_neighbors:
self.assertEqual(graph.nodes[n]['label'], 'E')
# if each vertex has correct number of neighbors (based on neighbour interiors count)
for n in all_neighbors:
node_neighbors = get_neighbors_at(graph, n,
graph.nodes[n]['layer'])
i_neighbors = [
x for x in node_neighbors if graph.nodes[x]['label'] == 'I'
]
if len(i_neighbors) == 1:
self.assertEqual(len(node_neighbors), 3)
elif len(i_neighbors) == 2:
self.assertEqual(len(node_neighbors), 5)
else: # 4
self.assertEqual(len(node_neighbors), 9)
def visualize_if_enabled(self, graph):
if self.visualize:
visualize_graph_3d(graph)
pyplot.show()
