-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbfs.py
More file actions
56 lines (45 loc) · 1.32 KB
/
bfs.py
File metadata and controls
56 lines (45 loc) · 1.32 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
import unittest
class BFS(object):
def __init__(self):
self.adjacency_list = {}
def add_edge(self, src, dst):
if src not in self.adjacency_list:
self.adjacency_list[src] = [dst]
else:
self.adjacency_list[src] += [dst]
if dst not in self.adjacency_list:
self.adjacency_list[dst] = [src]
else:
self.adjacency_list[dst] += [src]
def bfs(self, start):
visited = []
queue = [start]
while queue:
vertex = queue.pop(0)
if vertex not in visited:
visited.append(vertex)
for v in self.adjacency_list[vertex]:
if v not in visited:
queue.append(v)
return visited
class TestBFS(unittest.TestCase):
def test(self):
bfs = BFS()
edge_set = [[1, 2],
[1, 3],
[2, 4],
[2, 5],
[4, 8],
[5, 8],
[3, 6],
[3, 7],
[6, 8],
[7, 8]]
for sv, ev in edge_set:
bfs.add_edge(sv, ev)
self.assertEqual(
bfs.bfs(1),
[1, 2, 3, 4, 5, 6, 7, 8]
)
if __name__ == '__main__':
unittest.TestCase()