mia/pathfinding-async-magic-without-async
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Initial commit

Browse source
This commit is contained in:
mia 2025-10-16 09:37:38 +02:00
commit 52ebbfb335
7 changed files with 309 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

23
test.py Normal file
View file

@ -0,0 +1,23 @@
import Path_Finding_L1 as pf
start = (0,0)
goal = (4,4)
maze = [
[0, 1, 0, 0, 0],
[0, 1, 0, 1, 0],
[0, 0, 0, 1, 0],
[0, 1, 1, 1, 0],
[0, 0, 0, 0, 0]
]
queue, visited = pf.initialize_queue_and_visited(start)
neighbors = pf.get_neighbors(start[0],start[1],maze, {(0,2)})
pf.bfs_maze_solver(maze, start, goal)
# visited = visited | set(neighbors)
# print(visited)