Issue #87: solutions refactored

Author: Hamid Gasmi

3-graph-algorithms/1_graph_decomposition/reachability.py

@@ -41,9 +41,9 @@ def explore_dfs(self, u, v):
             return 1
 
         self.visit(u)
-        for i in range(len(self.adj[u])):
-            if not self.isVisited(self.adj[u][i]):
-                if self.explore_dfs(self.adj[u][i], v) == 1:
+        for a in self.adj[u]:
+            if not self.isVisited(a):
+                if self.explore_dfs(a, v) == 1:
                     return 1
 
         return 0
@@ -65,8 +65,8 @@ def explore_bfs(self, u, v, q):
                 return 1
             self.visit(u)
 
-            for i in range(len(self.adj[u])):
-                self.enqueue(q, self.adj[u][i])
+            for a in self.adj[u]:
+                self.enqueue(q, a)
         return 0
 
     def enqueue(self, q, v):
@@ -95,4 +95,4 @@ def reach(n, edges, u, v, solution):
     x, y = data[2 * m:]
     x, y = x - 1, y - 1
 
-    print(reach(n, edges, x, y, 2))
+    print(reach(n, edges, x, y, 1))

3-graph-algorithms/1_graph_decomposition/reachability_parralel_bfs.py

@@ -47,8 +47,8 @@ def explore(self, u):
             if self.visit(u):
                 return 1
 
-            for i in range(len(self.adj[u])):
-                self.enqueue(self.adj[u][i])
+            for a in self.adj[u]:
+                self.enqueue(a)
 
         return 0