[Python] 백준 1260 & 백준 11724

백준 1260

# 백준 1260
from collections import deque
n, m, v = map(int, input().split())
graph = [[] for _ in range(n+1)]
for _ in range(m):
    a, b = map(int, input().split())
    graph[a].append(b)
    graph[b].append(a)

def bfs(start_node):
    queue = deque()
    queue.append(start_node)
    visited[start_node] = True
    while queue:
        now = queue.popleft()
        print(now, end=" ")
        for next_node in graph[now]:
            if not visited[next_node]:
                queue.append(next_node)
                visited[next_node] = True

def dfs(node):
    visited[node] = True
    print(node, end=" ")
    for next in graph[node]:
        if not visited[next]:
            dfs(next)

for i in graph: # 정점이 여러 개인 경우에는 정점 번호가 작은 것을 먼저 방문
    i.sort()

visited = [False] * (n + 1)
dfs(v)
print()
visited = [False] * (n + 1)
bfs(v)

 

백준 11724

# 백준 11724

from collections import deque
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
graph = [[] for _ in range(n+1)]
visited = [False] * (n+1)
queue = deque()
for _ in range(m):
    a, b= map(int, input().split())
    graph[a].append(b)
    graph[b].append(a)

def bfs(i):
    queue.append(i)
    visited[i] = True
    while queue:
        now = queue.popleft()
        for next in graph[now]:
            if not visited[next]:
                queue.append(next)
                visited[next] = True

cnt = 0
for i in range(1, n + 1):
    if not visited[i]:
        bfs(i)
        cnt += 1
print(cnt)

 

 

오랜만에 코테를 다시 풀어봣다

마니 까먹어서 감잡을려구 쉬운 bfs문제부터ㅎ

앞으로 매일 2문제 업로드 도전!!^_^...