백준 촌수계산

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

2644번: 촌수계산

쉽네여~

#include <iostream>
#include <vector>
#include <algorithm>
#include<string>
#include<queue>
#include<map>
#include<stack>
#include<bitset>
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;

};

int main() {

	//사람수
	int n;
	cin >> n;
	int start;
	int end;
	cin >> start>> end;
	//촌수를 계산해야 하는 서로 다른 두번 번호 7 ,3 의 관계
	//
	int m;
	cin >> m;
	vector<Point>maps;
	for (int i = 0; i < m; i++) {
		Point p;
		cin >> p.s;
		cin >> p.e;
		maps.push_back(p);
	}
	
	vector<bool>bVisited(n,false);

	bVisited[start - 1] = true;
	queue<Data>q;
	Data d;
	d.cnt = 0;
	d.index = start;
	q.push(d);
	int count = 0;
	bool bCheck = false;
	while (!q.empty()) {
		Data startPerson=q.front();
		q.pop();
		if (startPerson.index == end) {
			bCheck = true;
			cout << startPerson.cnt;
			break;
		}
		for (int i = 0; i < m; i++) {
			if (startPerson.index == maps[i].s&&bVisited[maps[i].e - 1]==false) {
				bVisited[maps[i].e - 1] = true;
			
				Data d;
				d.cnt=startPerson.cnt+1;
				d.index = maps[i].e;
				q.push(d);
				
			}
			if (startPerson.index == maps[i].e&&bVisited[maps[i].s - 1] == false) {
				bVisited[maps[i].s - 1] = true;
				
				Data d;
				d.cnt = startPerson.cnt + 1;
				d.index = maps[i].s;
				q.push(d);
				
			}

		}

	}
	if (bCheck == false) {
		cout << -1;
	}
	
	return 0;
}