백준 2606번: 바이러스

2606번: 바이러스 (acmicpc.net)

2606번: 바이러스

from collections import deque
import sys
n = int(input())
m = int(input())
com = []
graph = [[0]]
visited = [False] * (n+1)
 
 
for i in range(m):
    co = list(map(int,sys.stdin.readline().split()))
    com.append(co)
for j in range(m):
    com[j].sort
for k in range(n):
    graph.append([])
    for l in range(m):
        if k+1 in com[l]:
            if k+1==com[l][0]:
                graph[k+1].append(com[l][1])
            else:
                graph[k + 1].append(com[l][0])
 
 
def bfs(Graph, s, Visited):
    queue = deque([s])
    Visited[s] = True
    count = 0
    while queue:
        v = queue.popleft()
        count+=1
 
        for i in Graph[v]:
            if Visited[i] is False:
                queue.append(i)
                Visited[i] = True
    return count
 
 
result=bfs(graph, 1, visited)
print(result-1)