-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraph_test.py
61 lines (52 loc) · 1.69 KB
/
graph_test.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
import unittest
from graph import Graph
class GraphTest(unittest.TestCase):
def setUp(self):
# undirected graph
# 1
# / \
# 2 3
# | \ |
# | \ |
# 4 --- 5
# \ /
# 6
self.graph = Graph()
self.graph.add_edge(1, 2)
self.graph.add_edge(1, 3)
self.graph.add_edge(2, 1)
self.graph.add_edge(2, 4)
self.graph.add_edge(2, 5)
self.graph.add_edge(3, 1)
self.graph.add_edge(3, 5)
self.graph.add_edge(4, 2)
self.graph.add_edge(4, 5)
self.graph.add_edge(4, 6)
self.graph.add_edge(5, 2)
self.graph.add_edge(5, 3)
self.graph.add_edge(5, 4)
self.graph.add_edge(5, 6)
self.graph.add_edge(6, 4)
self.graph.add_edge(6, 5)
# directed graph (binary tree)
#
# 1
# / \
# 2 3
# / \
# 4 5
self.binary_tree = Graph()
self.binary_tree.add_edge(1, 2)
self.binary_tree.add_edge(1, 3)
self.binary_tree.add_edge(2, 4)
self.binary_tree.add_edge(2, 5)
def test_graph_bfs(self):
self.assertEqual(self.graph.bfs(1), [1, 2, 3, 4, 5, 6])
self.assertEqual(self.graph.bfs(4), [4, 2, 5, 6, 1, 3])
self.assertEqual(self.binary_tree.bfs(1), [1, 2, 3, 4, 5])
def test_graph_dfs(self):
self.assertEqual(self.graph.dfs(1), [1, 2, 4, 5, 3, 6])
self.assertEqual(self.graph.dfs(4), [4, 2, 1, 3, 5, 6])
self.assertEqual(self.binary_tree.dfs(1), [1, 2, 4, 5, 3])
if __name__ == "__main__":
unittest.main()