그래프 DFS

dfs.py

def dfs(vertex, graph):

    visited.add(vertex)
    print(vertex + 1, end = '') # 출력용

    for i, v in enumerate(graph[vertex]):
        if v == 1 and i not in visited:
            print(end=' -> ') # 출력용
            dfs(i, graph)

global visited # 방문 표시

if __name__ == "__main__":
    visited = set()
    graph = [
        [0, 1, 1, 0, 0, 0],
        [0, 0, 0, 1, 1, 0],
        [0, 0, 0, 1, 1, 0],
        [0, 0, 0, 0, 0, 1],
        [0, 0, 0, 1, 0, 1],
        [0, 0, 0, 0, 0, 0]
        ]

    dfs(0, graph)