bfsmaze.py

import collections
wall, clear, goal = 0, 1, 9 #change notations according to your usecase
width,height=map(int,input().split())

def bfs(maze, start):
    queue = collections.deque()
    queue.append(start)
    seen = set([start])
    while queue:
        path = queue.popleft()
        x, y = path
        if maze[y][x] == goal:
            return True
        for x2, y2 in ((x+1,y), (x-1,y), (x,y+1), (x,y-1)): #directions
            if ( 0 <= x2 < width and  #X-axis in range
                0 <= y2 < height and  #y-axis
                maze[y2][x2] != wall and  #not a wall
                (x2, y2) not in seen): #not visited
                queue.append( (x2, y2))
                seen.add((x2, y2))
    return False

mat=[list(map(int,input().split())) for i in range(height)]

ans = 0 if mat[0][0]==0 else bfs(mat,(0,0)) #check if start(0,0) is walkable or not if not return False else Run BFS
print(ans) #if path exist it will print True else prints False