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
| import unittest
|
| from pygraph.graphdemo import Graph
| from pygraph.shortestpath import bfs
|
|
| class ShortestPathTestCase(unittest.TestCase):
| def test_bfs(self):
| g = Graph()
| g.add_edges(0, [1, 2])
| g.add_edges(1, [0, 3, 4])
| g.add_edges(2, [0, 4, 6, 7])
| g.add_edges(3, [1])
| g.add_edges(4, [1, 2, 5])
| g.add_edges(5, [4])
| g.add_edges(6, [2])
| g.add_edges(7, [2])
| #print(g)
| # self.assertEqual(True, False) # add assertion here
|
| tree = bfs(g, 0)
| print(tree)
|
|
| if __name__ == '__main__':
| unittest.main()
|
|
