DijkstraShortestPathUnitTest

Complexity

Total Complexity

4

Size/Duplication

Total Lines	10
Duplicated Lines	100 %

Importance

Changes	1
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	test_shortest_path()	9	9	4

import unittest

from pyalgs.algorithms.graphs.directed_cycle import DirectedCycle
from pyalgs.algorithms.graphs.shortest_path import DijkstraShortestPath, TopologicalSortShortestPath, \
    BellmanFordShortestPath
from tests.algorithms.graphs.util import create_edge_weighted_digraph


class DijkstraShortestPathUnitTest(unittest.TestCase):

This code seems to be duplicated in your project.

    def test_shortest_path(self):
        g = create_edge_weighted_digraph()
        s = 0
        dijkstra = DijkstraShortestPath(g, s)
        for v in range(1, g.vertex_count()):
            if dijkstra.hasPathTo(v):
                print(str(s) + ' is connected to ' + str(v))
                print('shortest path is ' + ' .. '.join([str(i) for i in dijkstra.shortestPathTo(v)]))
                print('path length is ' + str(dijkstra.path_length_to(v)))


class TopologicalSortShortestPathUnitTest(unittest.TestCase):

This code seems to be duplicated in your project.

    def test_shortest_path(self):
        g = create_edge_weighted_digraph()
        assert not DirectedCycle(g).hasCycle()
        s = 0
        dijkstra = TopologicalSortShortestPath(g, s)
        for v in range(1, g.vertex_count()):
            if dijkstra.hasPathTo(v):
                print(str(s) + ' is connected to ' + str(v))
                print('shortest path is ' + ' .. '.join([str(i) for i in dijkstra.shortestPathTo(v)]))
                print('path length is ' + str(dijkstra.path_length_to(v)))


class BellmanFordShortestPathUnitTest(unittest.TestCase):

This code seems to be duplicated in your project.

    def test_shortest_path(self):
        g = create_edge_weighted_digraph()
        s = 0
        dijkstra = BellmanFordShortestPath(g, s)
        for v in range(1, g.vertex_count()):
            if dijkstra.hasPathTo(v):
                print(str(s) + ' is connected to ' + str(v))
                print('shortest path is ' + ' .. '.join([str(i) for i in dijkstra.shortestPathTo(v)]))
                print('path length is ' + str(dijkstra.path_length_to(v)))


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