跑 K 遍 dijkstra ,每次可以求得点 给定点到每个点的最小距离
判断非联通的的话 就是有一个点到 给定点的距离 是 INF
(注:博客作为交流使用,切勿抄袭应付作业)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100000+7, INF = 0x7f7f7f7f;
int n, m, k, cnt;
int u, v;
double ans;
int d[maxn], vis[maxn];
struct edge {
int u, c, next;
}e[maxn];
int head[maxn];
void init() {
scanf("%d %d", &n, &m);
memset(head, -1, sizeof head);
int cnt = 0;
for(int i = 0; i < m; ++i) {
scanf("%d %d", &u, &v);
e[cnt].u = v; e[cnt].c = 1; e[cnt].next = head[u]; head[u] = cnt++;
e[cnt].u = u; e[cnt].c = 1; e[cnt].next = head[v]; head[v] = cnt++;
}
}
void dijkstra(int u) {
ans = 0;
memset(d, INF, sizeof d);
for(int i = head[u]; i != -1; i = e[i].next) {
d[e[i].u] = e[i].c;
}
memset(vis, 0, sizeof vis);
vis[u] = 1; d[u] = 0;
while(1) {
int t = -1;
for(int i = 1; i <= n; ++i) {
if(!vis[i] && (t == -1 || d[t] > d[i])) t = i;
}
if(t == -1) break;
vis[t] = 1;
for(int i = head[t]; i != -1; i = e[i].next)
d[e[i].u] = min(d[e[i].u], d[t]+e[i].c);
}
int cnt = 0, sum = 0;
for(int i = 1; i <= n; ++i) {
if(d[i] == INF) { ans = 0; return ; }
if(d[i] != 0 ) sum += d[i], cnt++;
}
ans = (1.0*cnt) / (1.0*sum);
}
void solve() {
scanf("%d", &k);
int uu;
for(int i = 0; i < k; ++i) {
scanf("%d", &uu);
dijkstra(uu);
printf("Cc(%d)=%.2lf\n", uu, ans);
}
}
int main() {
init();
solve();
return 0;
}
/*
9 14
1 2
1 3
1 4
2 3
3 4
4 5
4 6
5 6
5 7
5 8
6 7
6 8
7 8
7 9
3 3 4 9
*/