[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

A_star_searching_algorithm/A_star_search.py

@@ -7,15 +7,15 @@
 
 class Cell:
     def __init__(self):
-      # Parent cell's row index
+        # Parent cell's row index
         self.parent_i = 0
-    # Parent cell's column index
+        # Parent cell's column index
         self.parent_j = 0
- # Total cost of the cell (g + h)
-        self.f = float('inf')
-    # Cost from start to this cell
-        self.g = float('inf')
-    # Heuristic cost from this cell to destination
+        # Total cost of the cell (g + h)
+        self.f = float("inf")
+        # Cost from start to this cell
+        self.g = float("inf")
+        # Heuristic cost from this cell to destination
         self.h = 0
 
 
@@ -29,24 +29,28 @@ def __init__(self):
 def is_valid(row, col):
     return (row >= 0) and (row < ROW) and (col >= 0) and (col < COL)
 
+
 # Check if a cell is unblocked
 
 
 def is_unblocked(grid, row, col):
     return grid[row][col] == 1
 
+
 # Check if a cell is the destination
 
 
 def is_destination(row, col, dest):
     return row == dest[0] and col == dest[1]
 
+
 # Calculate the heuristic value of a cell (Euclidean distance to destination)
 
 
 def calculate_h_value(row, col, dest):
     return ((row - dest[0]) ** 2 + (col - dest[1]) ** 2) ** 0.5
 
+
 # Trace the path from source to destination
 
 
@@ -57,7 +61,10 @@ def trace_path(cell_details, dest):
     col = dest[1]
 
     # Trace the path from destination to source using parent cells
-    while not (cell_details[row][col].parent_i == row and cell_details[row][col].parent_j == col):
+    while not (
+        cell_details[row][col].parent_i == row
+        and cell_details[row][col].parent_j == col
+    ):
         path.append((row, col))
         temp_row = cell_details[row][col].parent_i
         temp_col = cell_details[row][col].parent_j
@@ -74,6 +81,7 @@ def trace_path(cell_details, dest):
         print("->", i, end=" ")
     print()
 
+
 # Implement the A* search algorithm
 
 
@@ -84,7 +92,9 @@ def a_star_search(grid, src, dest):
         return
 
     # Check if the source and destination are unblocked
-    if not is_unblocked(grid, src[0], src[1]) or not is_unblocked(grid, dest[0], dest[1]):
+    if not is_unblocked(grid, src[0], src[1]) or not is_unblocked(
+        grid, dest[0], dest[1]
+    ):
         print("Source or the destination is blocked")
         return
 
@@ -125,14 +135,26 @@ def a_star_search(grid, src, dest):
         closed_list[i][j] = True
 
         # For each direction, check the successors
-        directions = [(0, 1), (0, -1), (1, 0), (-1, 0),
-                      (1, 1), (1, -1), (-1, 1), (-1, -1)]
+        directions = [
+            (0, 1),
+            (0, -1),
+            (1, 0),
+            (-1, 0),
+            (1, 1),
+            (1, -1),
+            (-1, 1),
+            (-1, -1),
+        ]
         for dir in directions:
             new_i = i + dir[0]
             new_j = j + dir[1]
 
             # If the successor is valid, unblocked, and not visited
-            if is_valid(new_i, new_j) and is_unblocked(grid, new_i, new_j) and not closed_list[new_i][new_j]:
+            if (
+                is_valid(new_i, new_j)
+                and is_unblocked(grid, new_i, new_j)
+                and not closed_list[new_i][new_j]
+            ):
                 # If the successor is the destination
                 if is_destination(new_i, new_j, dest):
                     # Set the parent of the destination cell
@@ -150,7 +172,10 @@ def a_star_search(grid, src, dest):
                     f_new = g_new + h_new
 
                     # If the cell is not in the open list or the new f value is smaller
-                    if cell_details[new_i][new_j].f == float('inf') or cell_details[new_i][new_j].f > f_new:
+                    if (
+                        cell_details[new_i][new_j].f == float("inf")
+                        or cell_details[new_i][new_j].f > f_new
+                    ):
                         # Add the cell to the open list
                         heapq.heappush(open_list, (f_new, new_i, new_j))
                         # Update the cell details
@@ -164,6 +189,7 @@ def a_star_search(grid, src, dest):
     if not found_dest:
         print("Failed to find the destination cell")
 
+
 # Driver Code
 
 
@@ -178,7 +204,7 @@ def main():
         [1, 0, 1, 1, 1, 1, 0, 1, 0, 0],
         [1, 0, 0, 0, 0, 1, 0, 0, 0, 1],
         [1, 0, 1, 1, 1, 1, 0, 1, 1, 1],
-        [1, 1, 1, 0, 0, 0, 1, 0, 0, 1]
+        [1, 1, 1, 0, 0, 0, 1, 0, 0, 1],
     ]
 
     # Define the source and destination

A_star_searching_algorithm/README.md

@@ -255,8 +255,8 @@ if __name__ == "__main__":
 ***`output:`***
 ```bash
 The destination cell is found
-The Path is 
--> (8, 0) -> (7, 0) -> (6, 0) -> (5, 0) -> (4, 1) -> (3, 2) -> (2, 1) -> (1, 0) -> (0, 0) 
+The Path is
+-> (8, 0) -> (7, 0) -> (6, 0) -> (5, 0) -> (4, 1) -> (3, 2) -> (2, 1) -> (1, 0) -> (0, 0)
 ```
 
 - ***Time Complexity:*** O(E log V), where E is the number of edges and V is the number of vertices, due to the use of the priority queue.