reorganize graph

Author: danghai

graph/Transitive_Closure_DFS.py renamed to algorithms/graph/Transitive_Closure_DFS.py

@@ -0,0 +1 @@
+from .tarjan import *

algorithms/graph/__init__.py

@@ -3,7 +3,7 @@
 in a graph.
 https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
 """
-from graph.graph import DirectedGraph
+from algorithms.graph.graph import DirectedGraph
 
 class Tarjan(object):
     def __init__(self, dict_graph):
@@ -54,4 +54,4 @@ def strongconnect(self, v, sccs):
                     break
             scc.sort()
             sccs.append(scc)
-    
+    

graph/checkDiGraphStronglyConnected.py renamed to algorithms/graph/checkDiGraphStronglyConnected.py

@@ -1,4 +1,4 @@
-from graph.tarjan import Tarjan
+from algorithms.graph import Tarjan
 
 import unittest
 
@@ -41,4 +41,4 @@ def test_tarjan_example_2(self):
         }
 
         g = Tarjan(example)
-        self.assertEqual(g.sccs, [['A', 'B', 'E'], ['C', 'D'], ['F', 'G'], ['H']])
+        self.assertEqual(g.sccs, [['A', 'B', 'E'], ['C', 'D'], ['F', 'G'], ['H']])