DFS
graph = [ [], [2,3,8], [1,7], [1,4,5], [3,5], [3,4], [7], [2,6,8], [1,7] ] visited = [False]*9 def dfs(graph, v, visited) : visited[v] = True print(v, end=" ") print(visited) for i in graph[v] : if not visited[i] : dfs(graph, i, visited) # dfs(graph, 1, visited) def dfs(graph, v, visited) : visited[v] = True print(v, end=', ') print(visited) for move in graph[v] : if not visited[move] : dfs(grap..
2021. 1. 25.