da7e/amazing
1
0
Fork 0
mirror of https://github.com/maoakeEnterprise/amazing.git synced 2026-04-28 16:04:35 +02:00
Code Issues Packages Projects Releases Wiki Activity

fix buffer overflow in put pixel + margin calculation

Browse Source
This commit is contained in:
David GAILLETON
2026-03-30 14:37:33 +02:00
parent 92c6237f06
commit 0f77e0c6e4
3 changed files with 50 additions and 49 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/amaz_lib/MazeSolver.py
+8 -10
View File
@@ -11,7 +11,7 @@ class MazeSolver(ABC):
@abstractmethod
def solve(
self, maze: Maze, height: int = None, width: int = None
self, maze: Maze, height: int | None = None, width: int | None = None
) -> str: ...
@@ -38,9 +38,6 @@ class AStar(MazeSolver):
super().__init__(start, end)
self.path = []
def g(self, n: tuple[int, int]) -> int:
return len(self.path) + 1
def h(self, n: tuple[int, int]) -> int:
return (
max(n[0], self.end[0])
@@ -49,9 +46,6 @@ class AStar(MazeSolver):
- min(n[1], self.end[1])
)
def f(self, n: tuple[int, int]) -> int:
return self.g(n) + self.h(n)
def get_paths(
self,
maze: np.ndarray,
@@ -103,7 +97,7 @@ class AStar(MazeSolver):
self.start,
0,
self.h(self.start),
self.f(self.start),
self.h(self.start),
None,
)
)
@@ -161,7 +155,9 @@ class AStar(MazeSolver):
break
return res
def solve(self, maze: Maze, height: int = None, width: int = None) -> str:
def solve(
self, maze: Maze, height: int | None = None, width: int | None = None
) -> str:
path = self.get_path(maze.get_maze())
return self.translate(path)
@@ -170,7 +166,9 @@ class DepthFirstSearchSolver(MazeSolver):
def __init__(self, start, end):
super().__init__(start, end)
def solve(self, maze: Maze, height: int = None, width: int = None) -> str:
def solve(
self, maze: Maze, height: int | None = None, width: int | None = None
) -> str:
path_str = ""
visited = np.zeros((height, width), dtype=bool)
path = list()