forked from OmkarPathak/pygorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_data_structure.py
More file actions
241 lines (193 loc) · 7.56 KB
/
Copy pathtest_data_structure.py
File metadata and controls
241 lines (193 loc) · 7.56 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
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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
# -*- coding: utf-8 -*-
import unittest
from pygorithm.data_structures import (
stack,
queue,
linked_list,
tree,
graph,
heap)
class TestStack(unittest.TestCase):
def test_stack(self):
myStack = stack.Stack() # create a stack with default stack size 10
myStack.push(2)
myStack.push(10)
myStack.push(12)
myStack.push(3)
self.assertEqual(myStack.pop(), 3)
self.assertEqual(myStack.peek(), 12)
self.assertFalse(myStack.is_empty())
nullStack = stack.Stack()
self.assertEqual(nullStack.pop(), -1)
self.assertEqual(nullStack.peek(), -1)
self.assertTrue(nullStack.is_empty())
class TestInfixToPostfix(unittest.TestCase):
def test_infix_to_postfix(self):
myExp = 'a+b*(c^d-e)^(f+g*h)-i'
myExp = [i for i in myExp]
myStack = stack.Stack(len(myExp)) # create a stack
result = stack.InfixToPostfix(myExp, myStack)
resultString = result.infix_to_postfix()
expectedResult = 'a b c d ^ e - f g h * + ^ * + i -'
self.assertTrue(resultString, expectedResult)
class TestKruskal(unittest.TestCase):
def test_minimum_spanning_tree(self):
"""
test inspired from the example at the following link: https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
"""
edges_weighted = [((1, 2), 7), ((2, 3), 8), ((1, 4), 5), ((2, 4), 9),
((2, 5), 7), ((3, 5), 5), ((4, 6), 6), ((5, 6), 8),
((5, 7), 9), ((6, 7), 11), ((4, 5), 15)]
wgraph = graph.WeightedGraph()
for (u, v), weight in edges_weighted:
wgraph.add_edge(u, v, weight)
expected = [((1, 4), 5), ((3, 5), 5), ((4, 6), 6), ((1, 2), 7), ((2, 5), 7), ((5, 7), 9)]
self.assertEqual(wgraph.kruskal_mst(), expected)
def test_minimum_spanning_tree_2(self):
"""
Test inspired by the gif at the left of the page https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
"""
edges_weighted = [((1, 2), 3), ((1, 5), 1), ((2, 5), 4), ((2, 3), 5), ((3, 5), 6), ((3, 4), 2), ((4, 5), 7)]
wgraph = graph.WeightedGraph()
for (u, v), weight in edges_weighted:
wgraph.add_edge(u, v, weight)
expected = [((1, 5), 1), ((3, 4), 2), ((1, 2), 3), ((2, 3), 5)]
self.assertEqual(wgraph.kruskal_mst(), expected)
class TestQueue(unittest.TestCase):
def test_queue(self):
myQueue = queue.Queue() # create a queue with default queue size 10
myQueue.enqueue(2)
myQueue.enqueue(10)
myQueue.enqueue(12)
myQueue.enqueue(3)
self.assertEqual(myQueue.dequeue(), 2)
self.assertEqual(myQueue.dequeue(), 10)
self.assertFalse(myQueue.is_empty())
self.assertEqual(myQueue.dequeue(), 12)
self.assertEqual(myQueue.dequeue(), 3)
self.assertTrue(myQueue.is_empty())
def test_deque(self):
myDeque = queue.Deque()
myDeque.insert_front(1) # 1
myDeque.insert_rear(2) # 2 1
myDeque.insert_front(3) # 2 1 3
myDeque.insert_rear(10) # 10 2 1 3
self.assertEqual(myDeque.delete_rear(), 10)
self.assertEqual(myDeque.delete_front(), 3)
class TestLinkedList(unittest.TestCase):
def test_singly_linked_list(self):
List = linked_list.SinglyLinkedList()
List.insert_at_start(3)
List.insert_at_start(5)
List.insert_at_start(2)
List.insert_at_start(1)
List.insert_at_start(4)
List.insert_at_end(6)
expectedResult = [4, 1, 2, 5, 3, 6]
self.assertEqual(List.get_data(), expectedResult)
def test_doubly_linked_list(self):
dll = linked_list.DoublyLinkedList()
dll.insert_at_start(1)
dll.insert_at_start(2)
dll.insert_at_end(3)
dll.insert_at_start(4)
expectedResult = [4, 2, 1, 3]
self.assertEqual(dll.get_data(), expectedResult)
dll.delete(2)
expectedResult = [4, 1, 3]
self.assertEqual(dll.get_data(), expectedResult)
class TestBinaryTree(unittest.TestCase):
def test_binary_tree(self):
root = tree.Node(1)
root.set_left(tree.Node(2))
root.set_right(tree.Node(3))
root.left.set_left(tree.Node(4))
Tree = tree.BinaryTree()
inorderTraversal = Tree.inorder(root)
expectedResult = [4, 2, 1, 3]
self.assertEqual(inorderTraversal, expectedResult)
preorderTraversal = Tree.preorder(root)
expectedResult = [1, 2, 4, 3]
self.assertEqual(preorderTraversal, expectedResult)
postorderTraversal = Tree.postorder(root)
expectedResult = [4, 2, 3, 1]
self.assertEqual(postorderTraversal, expectedResult)
class TestBinarySearchTree(unittest.TestCase):
def test_binary_search_tree(self):
root = tree.BinarySearchTree()
root.insert(10)
root.insert(12)
root.insert(5)
root.insert(4)
root.insert(20)
root.insert(8)
root.insert(7)
root.insert(15)
root.insert(13)
inorder = root.inorder()
preorder = root.preorder()
postorder = root.postorder()
expectedResult = [4, 5, 7, 8, 10, 12, 13, 15, 20]
self.assertEqual(inorder, expectedResult)
expectedResult = [10, 5, 4, 8, 7, 12, 20, 15, 13]
self.assertEqual(preorder, expectedResult)
expectedResult = [4, 7, 8, 5, 13, 15, 20, 12, 10]
self.assertEqual(postorder, expectedResult)
self.assertTrue(root.find(8))
class TestGraph(unittest.TestCase):
def test_topological_sort(self):
myGraph = graph.TopologicalSort()
myGraph.add_edge(5, 2)
myGraph.add_edge(5, 0)
myGraph.add_edge(4, 0)
myGraph.add_edge(4, 1)
myGraph.add_edge(2, 3)
myGraph.add_edge(3, 1)
ans = myGraph.topological_sort()
expectedResult = [5, 4, 2, 3, 1, 0]
self.assertEqual(ans, expectedResult)
def test_cycle_in_directed_graph(self):
myGraph = graph.CheckCycleDirectedGraph()
myGraph.add_edge(0, 1)
myGraph.add_edge(0, 2)
myGraph.add_edge(1, 2)
myGraph.add_edge(2, 0)
myGraph.add_edge(2, 3)
myGraph.add_edge(3, 3)
self.assertTrue(myGraph.check_cycle())
def test_cycle_in_undirected_graph(self):
myGraph = graph.CheckCycleUndirectedGraph()
myGraph.add_edge(0, 1)
myGraph.add_edge(0, 2)
myGraph.add_edge(1, 2)
myGraph.add_edge(2, 0)
myGraph.add_edge(2, 3)
myGraph.add_edge(3, 3)
self.assertTrue(myGraph.check_cycle())
class TestHeap(unittest.TestCase):
def test_heap(self):
myHeap = heap.Heap()
myHeap.insert(6)
myHeap.insert(3)
myHeap.insert(5)
myHeap.insert(12)
myHeap.insert(1)
expectedResult = [1, 3, 5, 12, 6]
self.assertEqual(myHeap.queue, expectedResult)
self.assertEqual(myHeap.pop(), 1)
expectedResult = [3, 5, 12, 6]
self.assertEqual(myHeap.queue, expectedResult)
self.assertEqual(myHeap.pop(), 3)
expectedResult = [5, 12, 6]
self.assertEqual(myHeap.queue, expectedResult)
self.assertEqual(myHeap.pop(), 5)
expectedResult = [6, 12]
self.assertEqual(myHeap.queue, expectedResult)
self.assertEqual(myHeap.pop(), 6)
expectedResult = [12]
self.assertEqual(myHeap.queue, expectedResult)
self.assertEqual(myHeap.pop(), 12)
expectedResult = []
self.assertEqual(myHeap.queue, expectedResult)
if __name__ == '__main__':
unittest.main()