-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathgraph_tests.py
More file actions
136 lines (114 loc) · 3.61 KB
/
graph_tests.py
File metadata and controls
136 lines (114 loc) · 3.61 KB
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
import unittest
from dalpy.graphs import Vertex, VertexAttributeError, Graph, GraphVertexError, GraphEdgeError
from dalpy.sets import Set
class VertexTest(unittest.TestCase):
def test_init(self):
v = Vertex('a')
self.assertEqual(v.get_name(), 'a')
def test_hash(self):
v = Vertex('a')
self.assertEqual(hash(v), hash('a'))
def test_equal(self):
v = Vertex('a')
self.assertEqual(v, Vertex('a'))
def test_attribute(self):
v = Vertex('a')
v['color'] = 'blue'
self.assertEqual(v['color'], 'blue')
def test_invalid_attribute(self):
v = Vertex('a')
self.assertRaises(VertexAttributeError, lambda: v['color'])
def test_invalid_attribute_type(self):
v = Vertex('a')
def invalid_type():
v[1] = 'blue'
self.assertRaises(TypeError, lambda: invalid_type())
def test_init_with_attrs(self):
v = Vertex('a', color='red', time=1, seen=False)
self.assertEqual('red', v['color'])
self.assertEqual(1, v['time'])
self.assertFalse(v['seen'])
class GraphTest(unittest.TestCase):
def test_init(self):
g = Graph()
v = g.vertices()
self.assertIsInstance(v, Set)
self.assertTrue(v.is_empty())
def test_add_vertex(self):
g = Graph()
a = Vertex('a')
g.add_vertex(a)
v = g.vertices()
self.assertIsInstance(v, Set)
self.assertTrue(a in v)
self.assertEqual(v.size(), 1)
def test_color_vertices(self):
g = Graph()
names = ['a', 'b', 'c']
for n in names:
g.add_vertex(Vertex(n))
v = g.vertices()
for vertex in v:
vertex['color'] = 'red'
v_new = g.vertices()
for vertex in v_new:
self.assertEqual(vertex['color'], 'red')
def test_add_edge(self):
g = Graph()
a = Vertex('a')
b = Vertex('b')
g.add_vertex(a)
g.add_vertex(b)
g.add_edge(a, b, 0)
v = g.adj(a)
self.assertIsInstance(v, Set)
self.assertTrue(b in v)
self.assertEqual(v.size(), 1)
self.assertEqual(g.weight(a, b), 0)
def test_no_edge(self):
g = Graph()
a = Vertex('a')
b = Vertex('b')
g.add_vertex(a)
g.add_vertex(b)
self.assertRaises(GraphEdgeError, lambda: g.weight(a, b))
g.add_edge(a, b)
self.assertRaises(GraphEdgeError, lambda: g.weight(b, a))
def test_adj_invalid(self):
g = Graph()
a = Vertex('a')
self.assertRaises(GraphVertexError, lambda: g.adj(a))
def test_edge_invalid(self):
a = Vertex('a')
b = Vertex('b')
g = Graph()
self.assertRaises(GraphVertexError, lambda: g.add_edge(a, b, 0))
g.add_vertex(a)
self.assertRaises(GraphVertexError, lambda: g.add_edge(a, b, 0))
g = Graph()
g.add_vertex(b)
self.assertRaises(GraphVertexError, lambda: g.add_edge(a, b, 0))
def test_add_many_edges(self):
g = Graph()
a = Vertex('a')
b = Vertex('b')
c = Vertex('c')
g.add_vertex(a)
g.add_vertex(b)
g.add_vertex(c)
g.add_edge(a, b, 0)
g.add_edge(a, c, 0)
v = g.adj(a)
self.assertEqual(v.size(), 2)
self.assertTrue(b in v)
self.assertTrue(c in v)
def test_unweighted_edge(self):
g = Graph()
a = Vertex('a')
b = Vertex('b')
g.add_vertex(a)
g.add_vertex(b)
g.add_edge(a, b)
self.assertIsNone(g.weight(a, b))
if __name__ == '__main__':
unittest.main()