미로찾기 - dfs

미로 문제가 나왔을때 다음과 같이 변수들을 선언하고 알고리즘을 짠다.

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

visited = [[False]*len(graph[0]) for _ in range(len(graph))]

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

def solution(graph, visited, x, y, walk) :
    
    if not visited[y][x] or visited[y][x] > walk :
        visited[y][x] = walk
    else :
        return
    
    for i in range(4) :
        pos1 = x+dx[i]
        pos2 = y+dy[i]
        # indexerror가 난다면 넘어가고
        # 안나면 graph에서 안막혀있을때 방문처리
        if 0 <= pos1 < 5 and 0 <= pos2 < 5 and graph[pos2][pos1] :
            solution(graph, visited, pos1, pos2, walk+1)

if __name__ == "__main__" :
    
    solution(graph, visited, 0, 0, 0)
    visited[0][0] = 0
    
    for i in visited :
        print(*i)
    
    print(f"result = {visited[-1][-1]}")