DFS 예제

• depth-first search(깊이 우선 탐색) 코드 작성하기

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