Refactored and formatted code

Author: sourhub226

app.py

@@ -1,7 +1,7 @@
 import pygame
 from queue import PriorityQueue
 
-WIDTH = 800
+WIDTH = 700
 WIN = pygame.display.set_mode((WIDTH, WIDTH))
 pygame.display.set_caption("A* Path Finding Algorithm Visualizer")
 
@@ -19,8 +19,8 @@ class Node:
     def __init__(self, row, col, width, total_rows):
         self.row = row
         self.col = col
-        self.x = row*width
-        self.y = col*width
+        self.x = row * width
+        self.y = col * width
         self.color = WHITE
         self.neighhbours = []
         self.width = width
@@ -66,32 +66,37 @@ def make_path(self):
         self.color = YELLOW
 
     def draw(self, win):
-        pygame.draw.rect(
-            win, self.color, (self.x, self.y, self.width, self.width))
+        pygame.draw.rect(win, self.color, (self.x, self.y, self.width, self.width))
 
     def update_neighbours(self, grid):
         self.neighhbours = []
         # down
-        if self.row < self.total_rows - 1 and not grid[self.row+1][self.col].is_barrier():
-            self.neighhbours.append(grid[self.row+1][self.col])
+        if (
+            self.row < self.total_rows - 1
+            and not grid[self.row + 1][self.col].is_barrier()
+        ):
+            self.neighhbours.append(grid[self.row + 1][self.col])
         # up
-        if self.row > 0 and not grid[self.row-1][self.col].is_barrier():
-            self.neighhbours.append(grid[self.row-1][self.col])
+        if self.row > 0 and not grid[self.row - 1][self.col].is_barrier():
+            self.neighhbours.append(grid[self.row - 1][self.col])
         # right
-        if self.col < self.total_rows - 1 and not grid[self.row][self.col+1].is_barrier():
-            self.neighhbours.append(grid[self.row][self.col+1])
+        if (
+            self.col < self.total_rows - 1
+            and not grid[self.row][self.col + 1].is_barrier()
+        ):
+            self.neighhbours.append(grid[self.row][self.col + 1])
         # left
-        if self.col > 0 and not grid[self.row][self.col-1].is_barrier():
-            self.neighhbours.append(grid[self.row][self.col-1])
+        if self.col > 0 and not grid[self.row][self.col - 1].is_barrier():
+            self.neighhbours.append(grid[self.row][self.col - 1])
 
-    def __lt__(self, other):
+    def __lt__(self):
         return False
 
 
 def h(p1, p2):
     x1, y1 = p1
     x2, y2 = p2
-    return abs(x1-x2)+abs(y1-y2)
+    return abs(x1 - x2) + abs(y1 - y2)
 
 
 def reconstruct_path(came_from, current, draw):
@@ -127,12 +132,13 @@ def algorithm(draw, grid, start, end):
             return True
 
         for neighbour in current.neighhbours:
-            temp_g_score = g_score[current]+1
+            temp_g_score = g_score[current] + 1
             if temp_g_score < g_score[neighbour]:
                 came_from[neighbour] = current
                 g_score[neighbour] = temp_g_score
-                f_score[neighbour] = temp_g_score + \
-                    h(neighbour.get_pos(), end.get_pos())
+                f_score[neighbour] = temp_g_score + h(
+                    neighbour.get_pos(), end.get_pos()
+                )
                 if neighbour not in open_set_hash:
                     count += 1
                     open_set.put((f_score[neighbour], count, neighbour))
@@ -147,7 +153,7 @@ def algorithm(draw, grid, start, end):
 
 def make_grid(rows, width):
     grid = []
-    gap = width//rows
+    gap = width // rows
     for i in range(rows):
         grid.append([])
         for j in range(rows):
@@ -157,11 +163,11 @@ def make_grid(rows, width):
 
 
 def draw_grid(win, rows, width):
-    gap = width//rows
+    gap = width // rows
     for i in range(rows):
-        pygame.draw.line(win, GREY, (0, i*gap), (width, i*gap))
+        pygame.draw.line(win, GREY, (0, i * gap), (width, i * gap))
         for j in range(rows):
-            pygame.draw.line(win, GREY, (j*gap, 0), (j*gap, width))
+            pygame.draw.line(win, GREY, (j * gap, 0), (j * gap, width))
 
 
 def draw(win, grid, rows, width):
@@ -174,14 +180,14 @@ def draw(win, grid, rows, width):
 
 
 def get_clicked_pos(pos, rows, width):
-    gap = width//rows
+    gap = width // rows
     y, x = pos
-    row = y//gap
-    col = x//gap
+    row = y // gap
+    col = x // gap
     return row, col
 
 
-def main(win, width):
+def main(win, width):  # sourcery no-metrics
     ROWS = 50
     grid = make_grid(ROWS, width)
 
@@ -204,7 +210,7 @@ def main(win, width):
                 elif not end and spot != start:
                     end = spot
                     end.make_end()
-                elif spot != start and spot != end:
+                elif spot not in [start, end]:
                     spot.make_barrier()
             elif pygame.mouse.get_pressed()[2]:  # right mouse btn
                 pos = pygame.mouse.get_pos()
@@ -220,8 +226,7 @@ def main(win, width):
                     for row in grid:
                         for spot in row:
                             spot.update_neighbours(grid)
-                    algorithm(lambda: draw(win, grid, ROWS, width),
-                              grid, start, end)
+                    algorithm(lambda: draw(win, grid, ROWS, width), grid, start, end)
                 if event.key == pygame.K_c:
                     start = None
                     end = None