BreadthFirstSearchUnitTest

Complexity

Total Complexity

4

Size/Duplication

Total Lines	10
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	test_dfs()	0	9	4

import unittest

from pyalgs.algorithms.graphs.search import DepthFirstSearch, BreadthFirstSearch
from tests.algorithms.graphs.util import create_graph


class DepthFirstSearchUnitTest(unittest.TestCase):
    def test_dfs(self):
        g = create_graph()
        s = 0
        dfs = DepthFirstSearch(g, s)

        for v in range(1, g.vertex_count()):
            if dfs.hasPathTo(v):
                print(str(s) + ' is connected to ' + str(v))
                print('path is ' + ' => '.join([str(i) for i in dfs.pathTo(v)]))


class BreadthFirstSearchUnitTest(unittest.TestCase):
    def test_dfs(self):
        g = create_graph()
        s = 0
        dfs = BreadthFirstSearch(g, s)

        for v in range(1, g.vertex_count()):
            if dfs.hasPathTo(v):
                print(str(s) + ' is connected to ' + str(v))
                print('path is ' + ' => '.join([str(i) for i in dfs.pathTo(v)]))


if __name__ == '__main__':
    unittest.main()