Graph/test.py at master · matheusbmleite/Graph · GitHub

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
import unittest
from graph import Graph

class GraphTestCase(unittest.TestCase):
	def setUp(self):
		self.g = Graph()

	def test_insert_vertex(self):
		for i in range(1, 7):
			self.g.insert(i)

		vertexes = [1, 2, 3, 4, 5, 6]
		self.assertEqual(vertexes, list(self.g._vertexes.keys()))

	def test_remove_vertex(self):
		for i in range(1,7):
			self.g.insert(i)
		self.g.remove(1)
		vertexes = [2, 3, 4, 5, 6]
		self.assertEqual(vertexes, list(self.g._vertexes.keys()))

	def test_connect(self):
		self.g.insert(1)
		self.g.insert(2)
		self.g.connect(1,2)
		adjacents = {2}
		self.assertEqual(adjacents, self.g._vertexes[1])
		adjacents = {1}
		self.assertEqual(adjacents, self.g._vertexes[2])

	def test_disconnect(self):
		self.g.insert(1)
		self.g.insert(2)
		self.g.connect(1,2)
		self.g.disconnect(1,2)
		adjacents = set()
		self.assertEqual(adjacents, self.g._vertexes[1])
		self.assertEqual(adjacents, self.g._vertexes[2])

	def test_order(self):
		for i in range (1,100):
			self.g.insert(i)
		self.assertEqual(99, self.g.order())

	def test_vertixes(self):
		for i in range (1,5):
                        self.g.insert(i)
		vertexes = [1, 2, 3, 4]
		self.assertEqual(vertexes, self.g.vertexes())

	def test_a_vertex(self):
		for i in range (1,5):
			self.g.insert(i)
		self.assertTrue(self.g.a_vertex() == 1 or 2 or 3 or 4)

	def test_adjacents(self):
		for i in range (1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(1,4)
		adjacents = {2, 3, 4}
		self.assertEqual(adjacents, self.g.adjacents(1))

	def test_degree(self):
		for i in range (1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(1,4)
		degree = 3
		self.assertEqual(degree, self.g.degree(1))
		degree = 1
		self.assertEqual(degree, self.g.degree(2))
		self.assertEqual(degree, self.g.degree(3))


	def test_greater_degree(self):
		for i in range (1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(1,4)
		self.assertEqual(1, self.g.greater_degree())
		self.g.disconnect(1,2)
		self.g.connect(2,3)
		self.g.connect(3,4)
		self.assertEqual(3, self.g.greater_degree())
		self.assertNotEqual(1, self.g.greater_degree())


	def test_is_regular(self):
		for i in range(1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(2,3)
		self.g.connect(1,4)
		self.g.connect(2,4)
		self.g.connect(3,4)
		self.assertTrue(self.g.is_regular())
		self.g.disconnect(3,4)
		self.assertFalse(self.g.is_regular())

	def test_is_full(self):
		for i in range(1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(2,3)
		self.g.connect(1,4)
		self.g.connect(2,4)
		self.g.connect(3,4)
		self.assertTrue(self.g.is_full())
		self.g.disconnect(3,4)
		self.assertFalse(self.g.is_full())

	def test_transitive_closure(self):
		for i in range(1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(2,3)
		self.g.connect(1,4)
		self.g.connect(2,4)
		self.g.connect(3,4)
		transitive = {1,2,3,4}
		self.assertEqual(transitive, self.g.transitive_closure(1))
		self.g.insert(5)
		self.assertEqual(transitive, self.g.transitive_closure(1))

	def test_is_connected(self):
		for i in range(1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(2,3)
		self.g.connect(1,4)
		self.g.connect(2,4)
		self.g.connect(3,4)
		self.assertTrue(self.g.is_connected())
		self.g.insert(5)
		self.assertFalse(self.g.is_connected())


	def test_is_tree(self):
		for i in range(1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(2,3)
		self.g.connect(1,4)
		self.g.connect(2,4)
		self.g.connect(3,4)
		self.assertFalse(self.g.is_tree())
		self.g.disconnect(2,4)
		self.g.disconnect(3,4)
		self.g.disconnect(2,3)
		self.assertTrue(self.g.is_tree())

	def test_has_cicle(self):
		for i in range(1,5):
			self.g.insert(i)
		self.g.connect(1,2)
		self.g.connect(1,3)
		self.g.connect(2,3)
		self.g.connect(1,4)
		self.assertTrue(self.g.has_cicle())
		self.g.disconnect(2,3)
		self.assertFalse(self.g.has_cicle())


if __name__ == '__main__':
	unittest.main()