BorisovMI/lab_2/docs/data/maze.py

@@ -0,0 +1,68 @@
+from abc import ABC, abstractclassmethod
+from collections import deque
+import heapq
+import time
+import os
+import time
+import csv
+import random
+class Cell:
+    def __init__(self, x, y):
+        self.x = x
+        self.y = y
+        self.isWall = False
+        self.isStart = False
+        self.isExit = False
+    
+    
+    def __eq__(self, other):
+        if other is None:
+            return False
+        return self.x == other.x and self.y == other.y
+    def __lt__(self, other):
+        
+        if other is None:
+            return False
+        return (self.x, self.y) < (other.x, other.y)
+    def __hash__(self):
+        
+        return hash((self.x, self.y))
+    
+    def __repr__(self):
+        return f"Cell({self.x}, {self.y})"
+    def isPassable(self):
+        return not self.isWall
+
+class Maze:
+    def __init__(self, width, height):
+        self.width = width
+        self.height = height
+        self.grid = [[Cell(x, y) for y in range(height)] for x in range(width)]
+        self.start = None
+        self.exit = None
+    
+    def getCell(self, x, y):
+        if 0 <= x < self.width and 0 <= y < self.height:
+            return self.grid[x][y]
+        return None
+    
+    def getNeighbors(self, cell):
+        neighbors = []
+        directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]  
+        for dx, dy in directions:
+            neighbor = self.getCell(cell.x + dx, cell.y + dy)
+            if neighbor and neighbor.isPassable():
+                neighbors.append(neighbor)
+        return neighbors
+    
+    def setStart(self, x, y):
+        cell = self.getCell(x, y)
+        if cell:
+            cell.isStart = True
+            self.start = cell
+    
+    def setExit(self, x, y):
+        cell = self.getCell(x, y)
+        if cell:
+            cell.isExit = True
+            self.exit = cell

BorisovMI/lab_2/docs/data/maze_small.txt

@@ -0,0 +1,10 @@
+s         
+          
+ #  # #   
+  #   ##  
+   # ##   
+##      ##
+ # ##     
+         #
+         #
+         e