Issue 87 (Finding an Exit from a Maze): solved with a Graph BFS exploration

Author: Hamid Gasmi

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

@@ -69,6 +69,7 @@ def reach(adj, n, u, v, solution):
         return aMaze.explore_bfs(u, v, q)
     elif solution == 3:
         return 0
+        
     else:
         return 0