백준 바이러스

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

2606번: 바이러스

쉽네요

#include <iostream>
#include <vector>
#include <algorithm>
#include<string>
#include<queue>
#include<map>
#include<stack>
#include<bitset>
#include<cmath>
using namespace std;

void Prints(vector<vector<char>>maps, int r, int c) {
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cout << maps[i][j] << ",";
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<bool>>maps, int r, int c) {
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cout << maps[i][j] << ",";
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<int>>maps, int r, int c) {
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cout << maps[i][j] << ",";
		}
		cout << endl;
	}
	cout << endl;
}
struct Point {
	int s;
	int e;
	int cnt;
};
struct Data {
	int index;
	int cnt = 0;
	int gc = 1;

};

int main() {
	//컴퓨터수
	int n;
	//간선의수
	int m;
	cin >> n >> m;
	vector<Point>maps;
	for (int i = 0; i < m; i++) {
		int s;
		int e;
		cin >> s;
		cin >> e;
		Point p;
		p.s = s;
		p.e = e;
		maps.push_back(p);
	}
	vector<bool>bVisited(n, false);
	
	Data d;
	d.index = 1;
	bVisited[d.index - 1] = true;
	queue<Data>q;
	q.push(d);
	int count = 0;
	while (!q.empty()) {
		Data start = q.front();
		q.pop();
		for (int i = 0; i < m; i++) {
			//cout << maps[i].s << ",";
			if (maps[i].s == start.index && bVisited[maps[i].e - 1] == false) {
				bVisited[maps[i].e - 1] = true;
				Data d;
				d.index = maps[i].e;
				count++;
				
				q.push(d);
			}
			if (maps[i].e == start.index && bVisited[maps[i].s - 1] == false) {
				bVisited[maps[i].s - 1] = true;
				Data d;
				d.index = maps[i].s;
				count++;
				
				q.push(d);

			}
		}
	}
	cout << count;
	
	


	return 0;
}