22202956

refactored

Breath-First Search/breadth_first_search.py → Search_Algorithms/Search_Algorithms.py

 import queue
+from collections import deque
 
 
 def BreadthFirstSearch(state, successor, isgoal):
@@ -17,3 +18,22 @@ def BreadthFirstSearch(state, successor, isgoal):
                 path2 = path + [next_state]
                 toDo.put(path2)
     return "Error Path not found"
+
+
+def DepthFirstSearch(state, successor, isgoal):
+    """accepts start state, Please do not change this function"""
+    toDo = deque()
+    toDo.append([state])
+    explored = {state}
+    while not toDo:
+        path = toDo.pop()
+        current = path[-1]
+        if isgoal(current):
+            return path
+        for next_state in successor(current):
+            if next_state not in explored:
+                explored.add(next_state)
+                path2 = path + [next_state]
+                toDo.append(path2)
+    return "Error Path not found"
+

Breath-First Search/solution testing.py → Search_Algorithms/solution testing.py

-import breadth_first_search
+import Search_Algorithms
 import Sucessors
 import is_goal