def test_find_way_unknown_vertex(self):
vertex4 = Vertex()
vertex5 = Vertex()
with self.assertRaises(Exception):
self.simple_graph.find_way(self.vertex1, vertex4)
with self.assertRaises(Exception):
self.simple_graph.find_way(vertex4, vertex5)
def test_remove_edge_unknown_vertexes(self): vertex4 = Vertex() vertex5 = Vertex() with self.assertRaises(Exception): self.simple_graph.remove_edge(self.vertex1, vertex4) with self.assertRaises(Exception): self.simple_graph.remove_edge(vertex4, vertex5)
def setUp(self):
vertex1 = Vertex(1)
vertex2 = Vertex(2)
vertex3 = Vertex(3)
simple_graph = Graph(3)
simple_graph.add_vertex(vertex1)
simple_graph.add_vertex(vertex2)
simple_graph.add_vertex(vertex3)
self.vertex1, self.vertex2, self.vertex3 = vertex1, vertex2, vertex3
self.simple_graph = simple_graph
def test_add_excess_vertex(self): vertex4 = Vertex() with self.assertRaises(Exception): self.simple_graph.add_vertex(vertex4) self.assertNotIn(vertex4, self.simple_graph.vertex)
def test_get_vertex_index(self): vertex4 = Vertex() self.assertEqual(0, self.simple_graph.get_vertex_index(self.vertex1)) self.assertEqual(1, self.simple_graph.get_vertex_index(self.vertex2)) self.assertEqual(2, self.simple_graph.get_vertex_index(self.vertex3)) with self.assertRaises(Exception): self.simple_graph.add_vertex(vertex4)
def test_find_way_case_02(self): vertex1 = Vertex(1) vertex2 = Vertex(2) vertex3 = Vertex(3) vertex4 = Vertex(4) vertex5 = Vertex(5) vertex6 = Vertex(6) simple_graph = Graph(6) simple_graph.add_vertex(vertex1) simple_graph.add_vertex(vertex2) simple_graph.add_vertex(vertex3) simple_graph.add_vertex(vertex4) simple_graph.add_vertex(vertex5) simple_graph.add_vertex(vertex6) result_way = [vertex1, vertex3, vertex4, vertex6] simple_graph.add_edge(vertex1, vertex2) simple_graph.add_edge(vertex1, vertex3) simple_graph.add_edge(vertex3, vertex4) simple_graph.add_edge(vertex3, vertex5) simple_graph.add_edge(vertex4, vertex6) self.assertEqual(result_way, simple_graph.find_way(vertex1, vertex6))
def setUp(self): vertex1 = Vertex() vertex2 = Vertex() vertex3 = Vertex() simple_graph = Graph(3) simple_graph.add_vertex(vertex1) simple_graph.add_vertex(vertex2) simple_graph.add_vertex(vertex3) edge_1_3_vertex = [ [0, 0, 1], [0, 0, 0], [1, 0, 0] ] empty_m_adjacency = [] for __ in range(3): empty_m_adjacency.append([0, 0, 0]) self.vertex1, self.vertex2, self.vertex3 = vertex1, vertex2, vertex3 self.simple_graph, self.edge_1_3_vertex = simple_graph, edge_1_3_vertex self.empty_m_adjacency = empty_m_adjacency
def test_delete_unknown_vertex(self): vertex4 = Vertex() with self.assertRaises(Exception): self.simple_graph.delete_vertex(vertex4)
def test_get_nearbies_for_unknown_vertex(self):
simple_graph = Graph(3)
vertex1 = Vertex()
with self.assertRaises(Exception):
simple_graph.get_nearbies(vertex)