DFS(recursive)

내 코드

def sol(graph, start):
  print(start)
  for node in graph[start]:
    sol(graph,node)  
 
graph = {
    1 : [2, 3],
    2 : [4],
    3 : [],
    4 : []
}

sol(graph,1)
#출력
1
2
4
3

예시 코드

graph = {
    1 : [2, 3],
    2 : [4],
    3 : [],
    4 : []
}

def dfs(graph, node):
    print(node)
    
    for nei_node in graph[node]:
        dfs(graph, nei_node)

def sol(graph):
    dfs(graph, 1)

sol(graph)
# 출력
# 1
# 2
# 4
# 3