forked from nryoung/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_searching.py
More file actions
134 lines (121 loc) · 4.68 KB
/
test_searching.py
File metadata and controls
134 lines (121 loc) · 4.68 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
""" Unit Tests for searching """
import unittest
from ..searching import binary_search, kmp_search, rabinkarp_search, bmh_search, depth_first_search
class TestBinarySearch(unittest.TestCase):
"""
Tests Binary Search on a small range from 0-9
"""
def test_binarysearch(self):
self.seq = range(10)
rv1 = binary_search.search(self.seq, 0)
rv2 = binary_search.search(self.seq, 9)
rv3 = binary_search.search(self.seq, -1)
rv4 = binary_search.search(self.seq, 10)
rv5 = binary_search.search(self.seq, 4)
self.assertIs(rv1, 0)
self.assertIs(rv2, 9)
self.assertFalse(rv3)
self.assertFalse(rv4)
self.assertIs(rv5, 4)
self.seq = range(9)
rv1 = binary_search.search(self.seq, 0)
rv2 = binary_search.search(self.seq, 8)
rv3 = binary_search.search(self.seq, -1)
rv4 = binary_search.search(self.seq, 10)
rv5 = binary_search.search(self.seq, 4)
self.assertIs(rv1, 0)
self.assertIs(rv2, 8)
self.assertFalse(rv3)
self.assertFalse(rv4)
self.assertIs(rv5, 4)
class TestKMPSearch(unittest.TestCase):
"""
Tests KMP search on string "ABCDE FG ABCDEABCDEF"
"""
def test_kmpsearch(self):
self.string = "ABCDE FG ABCDEABCDEF"
rv1 = kmp_search.search(self.string, "ABCDEA")
rv2 = kmp_search.search(self.string, "ABCDER")
self.assertIs(rv1[0], 9)
self.assertFalse(rv2)
class TestRabinKarpSearch(unittest.TestCase):
"""
Tests Rabin-Karp search on string "ABCDEFGHIJKLMNOP"
"""
def test_rabinkarpsearch(self):
self.string = "ABCDEFGHIJKLMNOP"
rv1 = rabinkarp_search.search(self.string, "MNOP")
rv2 = rabinkarp_search.search(self.string, "BCA")
self.assertIs(rv1[0], 12)
self.assertFalse(rv2)
class TestBMHSearch(unittest.TestCase):
"""
Tests BMH search on string "ABCDE FG ABCDEABCDEF"
"""
def test_bmhsearch(self):
self.string = "ABCDE FG ABCDEABCDEF"
rv1 = bmh_search.search(self.string, "ABCDEA")
rv2 = bmh_search.search(self.string, "ABCDER")
self.assertIs(rv1[0], 9)
self.assertFalse(rv2)
class TestDepthFirstSearch(unittest.TestCase):
"""
Tests DFS on a graph represented by a adjacency list
"""
def test_dfs(self):
self.graph = {'A': ['B','C','E'],
'B': ['A','D','F'],
'C': ['A','G'],
'D': ['B'],
'F': ['B'],
'E': ['A'],
'G': ['C']}
rv1 = depth_first_search.dfs(self.graph, "A")
rv2 = depth_first_search.dfs(self.graph, "G")
rv1e = depth_first_search.dfs(self.graph, "Z")
self.assertEqual(rv1, ['A', 'B', 'D', 'F', 'C', 'G', 'E'])
self.assertEqual(rv2, ['G', 'C', 'A', 'B', 'D', 'F', 'E'])
self.assertEqual(rv1e, None)
self.graph = {1:[2,3,4],
2:[1,6,10],
3:[1,5,10],
4:[1,10,11],
5:[3,10],
6:[2,7,8,9],
7:[6,8],
8:[6,7],
9:[6,10],
10:[3,5,9,12],
11:[4],
12:[10]}
rv3 = depth_first_search.dfs(self.graph,1)
rv4 = depth_first_search.dfs(self.graph,5)
rv5 = depth_first_search.dfs(self.graph,6)
rv2e = depth_first_search.dfs(self.graph,99)
self.assertEqual(rv3, [1, 2, 6, 7, 8, 9, 10, 3, 5, 12, 4, 11])
self.assertEqual(rv4, [5, 3, 1, 2, 6, 7, 8, 9, 10, 12, 4, 11])
self.assertEqual(rv5, [6, 2, 1, 3, 5, 10, 9, 12, 4, 11, 7, 8])
self.assertEqual(rv2e, None)
self.graph = {1:[2,3,4,5,6],
2:[1,4,7,8,9],
3:[1,10],
4:[1,2,11,12],
5:[1,13,14,15],
6:[1,15],
7:[2],
8:[2],
9:[2,10],
10:[3,9],
11:[4],
12:[4],
13:[5],
14:[5],
15:[5,6]}
rv6 = depth_first_search.dfs(self.graph,1)
rv7 = depth_first_search.dfs(self.graph,10)
rv8 = depth_first_search.dfs(self.graph,5)
rv3e = depth_first_search.dfs(self.graph,-1)
self.assertEqual(rv6, [1, 2, 4, 11, 12, 7, 8, 9, 10, 3, 5, 13, 14, 15, 6])
self.assertEqual(rv7, [10, 3, 1, 2, 4, 11, 12, 7, 8, 9, 5, 13, 14, 15, 6])
self.assertEqual(rv8, [5, 1, 2, 4, 11, 12, 7, 8, 9, 10, 3, 6, 15, 13, 14])
self.assertEqual(rv3e, None)