Uploaded Bidirectional A Star Search Algorithm

Author: AnonSar

BidirectionalSearch.py renamed to BiDiAstarSearch.py

@@ -152,86 +152,35 @@ def heuristic(self, currentNode, targetNode):
     # method for getting the node with minimum value from the either direction
     def minValueNodeFromEitherDirection(self, forwardDiscovered, backwardDiscovered, forwardFinalized, backwardFinalised):
 
-        # -------- Direction with Minimum F value node ---------------------
-
-        # forwardMinItem = forwardDiscovered.rootItemAtHeap()
-        # backwardMinItem = backwardDiscovered.rootItemAtHeap()
-        #
-        # if forwardMinItem.f < backwardMinItem.f:
-        #
-        #     result = forwardDiscovered.minItemInHeap()
-        #     forwardFinalized.append(result)
-        #     return result, "forward"
-        #
-        # elif forwardMinItem.f > backwardMinItem.f:
-        #
-        #     result = backwardDiscovered.minItemInHeap()
-        #     backwardFinalised.append(result)
-        #     return result, "backward"
-        #
-        # elif forwardMinItem.f == backwardMinItem.f:
-        #
-        #     if forwardMinItem.h > backwardMinItem.h:
-        #
-        #         result = forwardDiscovered.minItemInHeap()
-        #         forwardFinalized.append(result)
-        #         return result, "forward"
-        #
-        #     else:
-        #
-        #         result = backwardDiscovered.minItemInHeap()
-        #         backwardFinalised.append(result)
-        #         return result, "backward"
-
-        # -------- Direction with Minimum F value node ---------------------
-
-        # ----------- Cardinality Criterion --------------------------------
-
-        if len(backwardDiscovered.getHeap()) < len(forwardDiscovered.getHeap()):
-
-            result = backwardDiscovered.minItemInHeap()
-            backwardFinalised.append(result)
-            return result, "backward"
-
-        elif len(backwardDiscovered.getHeap()) > len(forwardDiscovered.getHeap()):
-
+        forwardMinItem = forwardDiscovered.rootItemAtHeap()
+        backwardMinItem = backwardDiscovered.rootItemAtHeap()
+        
+        if forwardMinItem.f < backwardMinItem.f:
+        
             result = forwardDiscovered.minItemInHeap()
             forwardFinalized.append(result)
             return result, "forward"
-
-        elif len(backwardDiscovered.getHeap()) == len(forwardDiscovered.getHeap()):
-
-            forwardMinItem = forwardDiscovered.rootItemAtHeap()
-            backwardMinItem = backwardDiscovered.rootItemAtHeap()
-
-            if forwardMinItem.f < backwardMinItem.f:
-
+        
+        elif forwardMinItem.f > backwardMinItem.f:
+        
+            result = backwardDiscovered.minItemInHeap()
+            backwardFinalised.append(result)
+            return result, "backward"
+        
+        elif forwardMinItem.f == backwardMinItem.f:
+        
+            if forwardMinItem.h > backwardMinItem.h:
+        
                 result = forwardDiscovered.minItemInHeap()
                 forwardFinalized.append(result)
                 return result, "forward"
-
-            elif forwardMinItem.f > backwardMinItem.f:
-
+        
+            else:
+        
                 result = backwardDiscovered.minItemInHeap()
                 backwardFinalised.append(result)
                 return result, "backward"
 
-            elif forwardMinItem.f == backwardMinItem.f:
-
-                if forwardMinItem.h > backwardMinItem.h:
-
-                    result = forwardDiscovered.minItemInHeap()
-                    forwardFinalized.append(result)
-                    return result, "forward"
-
-                else:
-
-                    result = backwardDiscovered.minItemInHeap()
-                    backwardFinalised.append(result)
-                    return result, "backward"
-
-        # ----------- Cardinality Criterion --------------------------------
-
     def minItemFromList(self, node, givenList):
 
         for item in givenList:
@@ -723,4 +672,4 @@ def biDirectionalSearch(self, source, target):
 
 print("Number of correct cases: ", correct)
 print("Number of wrong cases: ", wrong)
-print("Number of not walkable source issues: ", unWalkable)
+print("Number of not walkable source issues: ", unWalkable)