new: kruskal generator

This commit is contained in:
2026-03-18 11:30:55 +01:00
parent b44cffec2c
commit 272ccefb52
6 changed files with 91 additions and 23 deletions
View File
-15
View File
@@ -1,15 +0,0 @@
from typing import Generator
import numpy as np
from .. import Cell
def kraskal(
height: int, width: int
) -> Generator[np.ndarray, None, np.ndarray]:
maze = np.array([[Cell(value=15) for _ in range(height)] * width])
cells_checked = np.array([[False for _ in range(height)] * width])
excepted_end = np.array([[True for _ in range(height)] * width])
while cells_checked != excepted_end:
yield maze
return maze
@@ -14,8 +14,8 @@ class Cell(BaseModel):
return self.value return self.value
def set_north(self, is_wall: bool) -> None: def set_north(self, is_wall: bool) -> None:
if (is_wall and self.value | 14 == 15) or ( if (not is_wall and self.value | 14 == 15) or (
not is_wall and self.value | 14 != 15 is_wall and self.value | 14 != 15
): ):
self.value = self.value ^ (1) self.value = self.value ^ (1)
@@ -23,8 +23,8 @@ class Cell(BaseModel):
return self.value & 1 == 1 return self.value & 1 == 1
def set_est(self, is_wall: bool) -> None: def set_est(self, is_wall: bool) -> None:
if (is_wall and self.value | 13 == 15) or ( if (not is_wall and self.value | 13 == 15) or (
not is_wall and self.value | 13 != 15 is_wall and self.value | 13 != 15
): ):
self.value = self.value ^ (2) self.value = self.value ^ (2)
@@ -32,8 +32,8 @@ class Cell(BaseModel):
return self.value & 2 == 2 return self.value & 2 == 2
def set_south(self, is_wall: bool) -> None: def set_south(self, is_wall: bool) -> None:
if (is_wall and self.value | 11 == 15) or ( if (not is_wall and self.value | 11 == 15) or (
not is_wall and self.value | 11 != 15 is_wall and self.value | 11 != 15
): ):
self.value = self.value ^ (4) self.value = self.value ^ (4)
@@ -41,8 +41,8 @@ class Cell(BaseModel):
return self.value & 4 == 4 return self.value & 4 == 4
def set_west(self, is_wall: bool) -> None: def set_west(self, is_wall: bool) -> None:
if (is_wall and self.value | 8 == 15) or ( if (not is_wall and self.value | 8 == 15) or (
not is_wall and self.value | 8 != 15 is_wall and self.value | 8 != 15
): ):
self.value = self.value ^ (8) self.value = self.value ^ (8)
+83
View File
@@ -0,0 +1,83 @@
from typing import Generator
import numpy as np
from ..classes.Cell import Cell
import math
def walls_to_maze(
walls: list[tuple[int, int]],
height: int,
width: int,
) -> np.ndarray:
maze: np.ndarray = np.array(
[[Cell(value=0) for _ in range(width)] for _ in range(height)]
)
for wall in walls:
x, y = wall
match y - x:
case 1:
maze[math.trunc((x / width))][x % width].set_est(True)
maze[math.trunc((y / width))][y % width].set_west(True)
case 5:
maze[math.trunc((x / width))][x % width].set_south(True)
maze[math.trunc((y / width))][y % width].set_north(True)
return maze
def is_in_same_set(sets: list[list[int]], wall: tuple[int, int]) -> bool:
a, b = wall
for set in sets:
if a in set and b in set:
return True
if a in set or b in set:
return False
return False
def merge_sets(sets: list[list[int]], wall: tuple[int, int]) -> None:
a, b = wall
base_set = None
for set in sets:
if base_set is None and (a in set or b in set):
base_set = set
elif base_set and (a in set or b in set):
base_set += set
sets.remove(set)
def kraskal(
height: int, width: int
) -> Generator[np.ndarray, None, np.ndarray]:
sets = [[i] for i in range(height * width)]
walls = []
for h in range(height):
for w in range(width - 1):
walls += [(w + (width * h), w + (width * h) + 1)]
for w in range(width):
for h in range(height - 1):
walls += [(w + (width * h), w + (width * h) + width)]
np.random.shuffle(walls)
yield walls_to_maze(walls, height, width)
for wall in walls:
if not is_in_same_set(sets, wall):
merge_sets(sets, wall)
walls.remove(wall)
yield walls_to_maze(walls, height, width)
return walls_to_maze(walls, height, width)
def main():
try:
for alg in kraskal(10, 10):
maze = alg
# print(maze)
# print()
print(maze)
except GeneratorExit as maze:
print(maze)
if __name__ == "__main__":
main()