-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtests.py
75 lines (58 loc) · 1.78 KB
/
tests.py
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
import unittest
from maze.maze import Maze
from pprint import pprint
class Tests(unittest.TestCase):
def test_maze_create_cells(self):
num_cols = 12
num_rows = 10
m1 = Maze(0, 0, num_rows, num_cols, 10, 10)
self.assertEqual(
len(m1._cells),
num_cols
)
self.assertEqual(
len(m1._cells[0]),
num_rows
)
def test_maze_rectangular_cells(self):
num_rows = 5
num_cols = 5
m1 = Maze(0, 0, num_rows, num_cols, 5, 10)
self.assertEqual(
len(m1._cells),
num_cols
)
self.assertEqual(
len(m1._cells[0]),
num_rows
)
def test_break_entrance_and_exit(self):
num_rows = 5
num_cols = 5
m1 = Maze(0, 0, num_rows, num_cols, 5, 10)
entrance_i, entrace_j = 0, 0
exit_i, exit_j = len(m1._cells) - 1, len(m1._cells) - 1
m1._break_entrance_and_exit()
self.assertEqual(
m1._cells[entrance_i][entrace_j].top_wall_active,
False,
"Entrance top wall expected to be False"
)
self.assertEqual(
m1._cells[exit_i][exit_j].bottom_wall_active,
False,
"Exit bottom wall expected to be false"
)
def test_reset_cells_visited(self):
num_rows = 5
num_cols = 5
m1 = Maze(0, 0, num_rows, num_cols, 5, 10)
m1._reset_cells_visited()
valid_matrix = True
for column in m1._cells:
for cell in column:
if cell.visited:
valid_matrix = False
self.assertTrue(valid_matrix, "Not all cells were reset")
if __name__ == "__main__":
unittest.main()