BreadthFirstSearchUnitTest

Complexity

Total Complexity

8

Size/Duplication

Total Lines	20
Duplicated Lines	100 %

Importance

Changes	2
Bugs	0	Features	0

2 Methods

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

import unittest

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


class DepthFirstSearchUnitTest(unittest.TestCase):

This code seems to be duplicated in your project.

    def test_dfs(self):
        g = create_graph() # or create_digraph
        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)]))

    def test_dfs_digraph(self):
        g = create_digraph()
        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):

This code seems to be duplicated in your project.

    def test_dfs(self):
        g = create_graph() # or create_digraph
        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)]))

    def test_dfs_digraph(self):
        g = create_digraph()
        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()