[백준] 11724번 연결 요소의 개수 (파이썬)

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

DFS

import sys
from collections import deque

n, m = map(int, sys.stdin.readline().split())
graph = [[] for _ in range(n+1)]
for _ in range(m):
    u, v = map(int, sys.stdin.readline().split())
    graph[u].append(v)
    graph[v].append(u)
    
visited = [False]*(n+1)

def dfs(graph, v):
    visited[v] = True
    
    for i in graph[v]:
        if not visited[v]:
            dfs(graph, i)
            
result = 0
for i in range(1, n+1):
    if not visited[i]:
        result += 1
        bfs(graph, i)

print(result) 

BFS

import sys
from collections import deque

n, m = map(int, sys.stdin.readline().split())
graph = [[] for _ in range(n+1)]
for _ in range(m):
    u, v = map(int, sys.stdin.readline().split())
    graph[u].append(v)
    graph[v].append(u)
    
visited = [False]*(n+1)

def bfs(graph, v):
    queue = deque([v])
    visited[v] = True
    result = []
    
    while queue:
        v = queue.popleft()
        for i in graph[v]:
            if not visited[i]:
                queue.append(i)
                visited[i] = True

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

print(result)