[백준] 11724번 연결 요소의 개수

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

11724번: 연결 요소의 개수

#include <iostream>
#include <vector>
#include <queue>
using namespace std;


int main() {
	int numOfNode, numOfEdge;
	cin >> numOfNode >> numOfEdge;
	vector<int> graph[1001];
	for (int i = 0; i < numOfEdge; i++) {
		int from, to;
		cin >> from >> to;
		graph[from].push_back(to);
		graph[to].push_back(from);
	}
	vector<bool> visited(numOfNode + 1);
	int count = 0;
	for (int i = 1; i <= numOfNode; i++) {
		if (!visited[i]) {
			queue<int> q;
			q.push(i);
			while (!q.empty()) {
				int cur = q.front();
				q.pop();
				if (!visited[cur]) {
					visited[cur] = true;
					for (int j = 0; j < graph[cur].size(); j++) {
						if (!visited[graph[cur][j]])
							q.push(graph[cur][j]);
					}
				}
			}
			count++;
		}
	}
	cout << count;
	return 0;
}