05-3. 六度空间 (30)

/***********************************************
 * Author: fisty
 * Created Time: 2015/1/11 22:31:32
 * File Name   : 05-3.cpp
 *********************************************** */
#include <iostream>
#include <cstring>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <algorithm>
using namespace std;
#define Debug(x) cout << #x << "x" << x <<endl
const int INF = 0x3f3f3f3f;
#define MAX_N 10100
int n, m;
vector<int> G[MAX_N];
int used[MAX_N];
int bfs(int v){
    int level = 0, last = v;
    int tail = 1;
    used[v] = 1;
    int count = 1;
    queue<int> que;
    que.push(v);
    while(!que.empty()){
        int p = que.front(); que.pop();
        for(int i = 0;i < G[p].size(); i++){
            int w = G[p][i];
            if(!used[w]){
                used[w] = 1;
                count++;
                que.push(w);
                tail = w;
            }
        }
        if(p == last){
            level++; last = tail;
        }
        if(level == 6) break;
    }
    return count;
}
int main() {
    //freopen("in.txt", "r", stdin);
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for(int i = 0;i < m; i++){
        //无向图
        int a, b;
        cin >> a >> b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    for(int i = 1; i <= n; i++){
        memset(used, 0, sizeof(used));
        int cnt = bfs(i);   //计算六层之内的顶点数
        printf("%d: %.2lf%%\n", i,(double)cnt / (double)n * 100);
    }
    return 0;
}