7-36 社交网络图中结点的“重要性”计算 (30 分)

层次遍历BFS
并查集判断

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
const int N = 1e4+5;
const int INF = 0x3f3f3f3f;
int n, m, cntt;
int root[N];
int vis[N];
vector<int> G[N];
int find(int x){
	if(root[x] != x) root[x] = find(root[x]);
	return root[x];
}
void bfs(int s){
	queue<int> q;
	q.push(s);
	memset(vis, 0, sizeof vis); //初始化的位置放错了 
	vis[s] = 1;
	cntt = 0;
	int level = 0;
	while(q.size()){
		int len = q.size();
		cntt += level * len;
		level++;
		for(int i = 0; i < len; i++){
			int t = q.front();
			q.pop();
			for(int j = 0; j < G[t].size(); j++){
				int v = G[t][j];
				if(!vis[v]) {
					q.push(v);
					vis[v] = 1;
				}
			}
		}
	}
}
int main(){
	int u, v, k, x;
	scanf("%d%d", &n, &m);
	for(int i = 0; i <= n; i++){
		root[i] = i;
	}
	int cnt = 1;
	while(m--){
		scanf("%d%d", &u, &v);
		G[u].push_back(v);
		G[v].push_back(u);
		int a = find(u);
		int b = find(v);
		if(a != b){
			root[b] = a;
			cnt++;
		}
	}
	scanf("%d", &k);
	while(k--){
		scanf("%d", &x);
		if(cnt != n) printf("Cc(%d)=0.00\n", x);
		else {
			bfs(x);
			printf("Cc(%d)=%.2f\n", x, (n-1)*1.0/cntt);
		}
	}
	
	return 0;
}