chen0040 / pyalgs

                print('path length is ' + str(dijkstra.path_length_to(v)))

class TopologicalSortShortestPathUnitTest(unittest.TestCase):

    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):

                print('path length is ' + str(dijkstra.path_length_to(v)))

class BellmanFordShortestPathUnitTest(unittest.TestCase):

    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__':

from tests.algorithms.graphs.util import create_edge_weighted_digraph

class DijkstraShortestPathUnitTest(unittest.TestCase):

    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):