畅通工程题解-BFS

#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int n;
int mat[N][N];
bool vis[N];

void bfs(int s) {
	queue<int >Q;
	vis[s] = true;
	Q.push(s);//入队，使s成为队尾元素
	while (Q.empty() == false) {//保证队列不为空
		int v = Q.front(); //取得队列头元素
		Q.pop();//出队，将队头元素删去
		for (int i = 0; i < n; i++) {
			if (mat[v][i] == 1 && vis[i] == false) {
				vis[i] = true;
				Q.push(i);
			}
		}
	}
}

int main() {
	while (true) {
		int i, m, a, b, cnt = 0;
		cin >> n;
		if (n == 0)
			break;
		cin >> m;
		fill(&mat[0][0], &mat[n - 1][n - 1] + 1, 0);//初始化
		fill(vis, vis + n, false);
		for ( i = 0; i < m; i++) {
			cin >> a >> b;
			a--;
			b--;
			mat[a][b] = 1;
			mat[b][a] = 1;
		}
		for (i = 0; i < n; i++)