baekjun 바이러스

bfs 하기

#include<bits/stdc++.h>
using namespace std;
int K, N;
int main(){
    int N, M;
    int edgeList[101][101];
    int visitedList[101];
    memset(edgeList, 0, sizeof(edgeList));
    memset(visitedList, 0, sizeof(visitedList));
    cin >> N >> M;
    for(int i = 0;i < M; i++){
        int src, dst;
        cin >> src >> dst;
        edgeList[src][dst] = 1;
        edgeList[dst][src] = 1;
    }
    queue<int> que;
    que.push(1);
    visitedList[1] = 1;
    int result = 0;
    while(!que.empty()){
        int current = que.front();
        que.pop();
        for(int dst = 1 ; dst <= N; dst++){
            if(edgeList[current][dst] && !visitedList[dst]){
                que.push(dst);
                visitedList[dst] = 1;
                result++;
            }
        }
    }
    cout << result;
    return 0;
}