StronglyConnectedComponentsUnitTest

Complexity

Total Complexity

4

Size/Duplication

Total Lines	15
Duplicated Lines	100 %

Importance

Changes

0

1 Method

Rating	Name	Duplication	Size	Complexity
A	test_cc()	14	14	4

import unittest
from random import randint

from pyalgs.algorithms.graphs.connectivity import ConnectedComponents, StronglyConnectedComponents
from tests.algorithms.graphs.util import create_graph_4_connected_components, \
    create_digraph_4_strongly_connected_components


class ConnectedComponentsUnitTest(unittest.TestCase):

This code seems to be duplicated in your project.

    def test_cc(self):
        G = create_graph_4_connected_components()

        cc = ConnectedComponents(G)
        print('connected component count: ' + str(cc.count()))

        self.assertEqual(3, cc.count())

        for v in range(G.vertex_count()):
            print('id[' + str(v) + ']: ' + str(cc.id(v)))
        for v in range(G.vertex_count()):
            r = randint(0, G.vertex_count() - 1)
            if cc.connected(v, r):
                print(str(v) + ' is connected to ' + str(r))


class StronglyConnectedComponentsUnitTest(unittest.TestCase):

This code seems to be duplicated in your project.

    def test_cc(self):
        G = create_digraph_4_strongly_connected_components()

        cc = StronglyConnectedComponents(G)
        print('strongly connected component count: ' + str(cc.count()))

        self.assertEqual(5, cc.count())

        for v in range(G.vertex_count()):
            print('id[' + str(v) + ']: ' + str(cc.id(v)))
        for v in range(G.vertex_count()):
            r = randint(0, G.vertex_count() - 1)
            if cc.connected(v, r):
                print(str(v) + ' is connected to ' + str(r))


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