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
| import unittest
|
| from graphdemo import Graph
| from src.graphdemo import greedy_color
|
|
| class GraphTestCase(unittest.TestCase):
| def test_construct_a_graph(self):
| g = Graph()
| g.add_edge(1, 2)
| g.add_edge(1, 3)
| g.add_edge(2, 3)
| g.add_edge(2, 4)
| txt = str(g)
| expected = '''1 → [2, 3]
| 2 → [1, 3, 4]
| 3 → [1, 2]
| 4 → [2]'''
| self.assertEqual(expected, txt)
| vertices = [1, 2, 3, 4]
| # def action(v): self.assertTrue(v in vertices)
| g.for_each_vertices(lambda v : self.assertTrue(v in vertices))
|
| def test_iterate_all_edges(self):
| g = Graph()
| g.add_edge(1, 2)
| g.add_edge(1, 3)
| g.add_edge(2, 3)
| g.add_edge(2, 4)
| edges = [
| "1-2", "1-3", "2-3", "2-4"
| ]
| edge_count = []
| def action(a, b):
| (s,e) = (a,b) if a < b else (b,a)
| edge = f"{s}-{e}"
| edge_count.append(edge)
| self.assertTrue(edge in edges)
| g.for_each_edges(action)
| self.assertEqual(len(edge_count), len(edges))
|
| def test_iterate_all_vertices(self):
| g = Graph()
| g.add_edge(1, 2)
| g.add_edge(1, 3)
| g.add_edge(2, 3)
| g.add_edge(2, 4)
| vertices = []
| for v in g.vertices():
| vertices.append(v)
| expected = [1, 2, 3, 4]
| self.assertListEqual(sorted(vertices), expected)
| pass
|
| def test_iterate_all_vertices_lambda(self):
| g = Graph()
| g.add_edge(1, 2)
| g.add_edge(1, 3)
| g.add_edge(2, 3)
| g.add_edge(2, 4)
| vertices = []
| g.for_each_vertices(lambda v : print(f"visit {v}"))
| print(vertices)
| pass
|
|
| def test_iterate_neighbor_vertex(self):
| g = Graph()
| g.add_edge(1, 2)
| g.add_edge(1, 3)
| g.add_edge(2, 3)
| g.add_edge(2, 4)
| g.add_edge(4, 1)
| vertices = []
| for v in g.adjacent_of(1):
| vertices.append(v)
| expected = [2, 3, 4]
| self.assertListEqual(sorted(vertices), expected)
| pass
|
| def test_not_add_float_to_vertex(self):
| g = Graph()
| try:
| g.add_vertex(1.2)
| pass
| except TypeError as ex:
| expected_msg = "Argument 1.2 is not a valid vertex"
| self.assertEqual(str(ex), expected_msg)
| pass
| pass
|
| def test_not_add_string_to_vertex(self):
| g = Graph()
| try:
| g.add_vertex("add")
| except TypeError as ex:
| expected_msg = 'Argument add is not a valid vertex'
| self.assertEqual(str(ex), expected_msg)
| pass
| pass
|
| def test_greedy_color(self):
| g = Graph()
| g.add_edges(0, [1, 2, 3])
| g.add_edges(1, [0, 3, 2])
| g.add_edges(2, [0, 1])
| g.add_edges(3, [1])
| print(g)
| vertices = [1, 3, 0, 2]
| colors = greedy_color(g, vertices)
| print(colors)
|
| def test_greedy_color_2(self):
| g = Graph()
| g.add_edges(0, [1,2, 3])
| g.add_edges(1, [0, 2, 4])
| g.add_edges(2, [0, 1, 5])
| g.add_edges(3, [0, 4, 5])
| g.add_edges(4, [1, 3, 5])
| g.add_edges(5, [2, 3, 4])
| print(g)
| vertices = [0, 3, 4, 2, 5, 1]
| #vertices = [0, 5, 3, 4, 2, 1]
| colors = greedy_color(g, vertices)
| print(colors)
| for vertex in g.vertices():
| color = colors[vertex]
| for nbr in g.adjacent_of(vertex):
| self.assertNotEqual(color, colors[nbr])
|
|
| if __name__ == '__main__':
| unittest.main()
|
|
