백준.DFS와 BFS.1260.py

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

1260번: DFS와 BFS

import sys
import queue
def solution_dfs(graph, start):
    visit, visited, resalt = [start], set(), []
    
    while visit:
        node = visit.pop()
        if node not in visited:
            visited.add(node)
            resalt.append(str(node))
            visit.extend(sorted(graph[node],reverse=True))

    return ' '.join(resalt)

def solution_bfs(graph, start):
    visit, visited, resalt = queue.Queue(), set(), []
    visit.put(start)
    while visit.qsize() > 0:
        node = visit.get()
        if node not in visited:
            visited.add(node)
            resalt.append(str(node))
            for n in sorted(graph[node]): visit.put(n)
    return ' '.join(resalt)

if __name__ == '__main__':
    n, m, v = map(int, sys.stdin.readline().rstrip().split())
    graph = dict()
    for _ in range(m):
        a, b = map(int, sys.stdin.readline().rstrip().split())
        if a in graph:
            graph[a].append(b)
        else:
            graph[a] = [b]
        if b in graph:
            graph[b].append(a)
        else:
            graph[b] = [a]
            
    if graph.get(v, False): 
        resalt_dfs = solution_dfs(graph, v)
        print(resalt_dfs)
        resalt_bfs = solution_bfs(graph, v)
        print(resalt_bfs)
    else: # 시작 정점이 다른 정점과 연결이 되어있지 않을 경우
        print(f'{v}\n{v}')