미로찾기 - bfs

from collections import deque

graph = [
    [1,1,1,0,0],
    [1,0,1,0,1],
    [1,1,1,1,1],
    [1,1,0,0,1],
    [1,1,1,1,1]
]

dx = [1,-1,0,0]
dy = [0,0,1,-1]

visited = [[False]*5 for _ in range(5)]
path = deque()

def solution(graph, visited, x, y) :
	visited[y][x] = True
    path = deque([[x, y]])
    
    while path :
        x, y = path.popleft()
        for i in range(4) :
            pos1, pos2 = x+dx[i], y+dy[i]
            if 0<=pos1<5 and 0<=pos2<5 and not visited[pos2][pos1] and graph[pos2][pos1] :
                visited[pos2][pos1] = visited[y][x]+1
                path.append([pos1, pos2])

if __name__=="__main__" :
    solution(graph, visited, 0, 0)
    
    for i in visited :
        print(*i)