interactive-coding-challenges/graphs_trees/graph_bfs/test_bfs.py

34 lines
767 B
Python
Raw Normal View History

2015-08-05 08:02:28 +08:00
from nose.tools import assert_equal
class TestBfs(object):
def __init__(self):
self.results = Results()
def test_bfs(self):
nodes = []
2016-09-10 19:40:52 +08:00
graph = GraphBfs()
2015-08-05 08:02:28 +08:00
for id in range(0, 6):
nodes.append(graph.add_node(id))
graph.add_edge(0, 1, 5)
graph.add_edge(0, 4, 3)
graph.add_edge(0, 5, 2)
graph.add_edge(1, 3, 5)
graph.add_edge(1, 4, 4)
graph.add_edge(2, 1, 6)
graph.add_edge(3, 2, 7)
graph.add_edge(3, 4, 8)
2016-09-10 19:40:52 +08:00
graph.bfs(nodes[0], self.results.add_result)
2015-08-05 08:02:28 +08:00
assert_equal(str(self.results), "[0, 1, 4, 5, 3, 2]")
print('Success: test_bfs')
def main():
test = TestBfs()
test.test_bfs()
if __name__ == '__main__':
main()