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)