C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 11724번:연결 요소의 개수 답

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int N, M, u, v,c[1001],cnt;
vector <int>a[1001];
queue <int> q;
void DFS(int x)
{
    c[x] = 1;
    for (int i = 0; i < a[x].size(); i++)
    {
        if (c[a[x][i]] == 0)
            DFS(a[x][i]);
    }
}
int main() {
    cin >> N >> M;
    for (int i = 0; i < M; i++)
    {
        cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }
    for (int i = 1; i <= N; i++)
    {
        if (c[i] == 0)
        {
            DFS(i);
            cnt++;
        }
    }
    cout << cnt;
}