Algorithms / 백준 1260번 파이썬

링크

https://www.acmicpc.net/problem/1260

풀이

코드

from collections import deque

def main():
    N, M, V = map(int, input().split())
    global graph, attendance, queue
    graph = [[] for _ in range(N+1)]
    attendance = [False] * (N+1)
    for _ in range(M):
        a, b = map(int, input().split())
        graph[a].append(b)
        graph[b].append(a)
    # sorting a graph
    for i in range(1, N+1):
        graph[i].sort()
    dfs(V)
    attendance = [False] * (N+1)
    print()
    bfs(V)
    print()

def bfs(n):
    q = deque([])
    q.append(n)
    attendance[n] = True
    while queue:
        v = q.popleft()
        print(v, end=' ')
        for item in graph[v]:
            if not attendance[item]:
                q.append(item)
                attendance[item] = True

def dfs(n):
    print(n, end=' ')
    attendance[n] = True
    for item in graph[n]:
        if not attendance[item]:
            dfs(item)
            
def printAdjacencyList(graph):
    print('printing graph after sorting...')
    for i in range(1, len(graph)):
        print(graph[i])

if __name__ == '__main__':
    main()

Algorithms / 백준 1260번 파이썬