六度空间

#include <iostream>
#include <queue>
#include <iomanip>
using namespace std;
#define MAXSIZE 1001
int g[MAXSIZE][MAXSIZE] = { 0 };
int visited[MAXSIZE] = { 0 };
void initVisited(int n)
{
	for (int i = 0; i < n; i++)
	{
		visited[i] = 0;
	}
}
int BFS(int v,int n)
{
	queue<int>q;
	visited[v] = 1;
	int count, level, last, tail,t;
	count = 1;//这个结点有多少人
	level = 0;//记录层数
	last = v;//这一层最后访问的一个结点
	q.push(v);//入队
	while (!q.empty())
	{
	    t = q.front();//记录当前访问的结点
		q.pop();//出队
		for (int i = 0; i < n; i++)
		{
			if (!visited[i]&&g[t][i])
			{
				visited[i] = 1;
				q.push(i);
				count++;
				tail= i;
			}
		}
		if (t == last)//如果这个结点是最后一个，则这一层结束
		{
			level++;
			last = tail;
		}
		if (level == 6)
		{
			break;
		}
	}
	return count;
}
int main()
{
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int x, y;
		cin >> x >> y;
		x--;
		y--;
		g[x][y] = 1;
		g[y][x] = 1;
	}
	int count;
	double percentage;
	for (int i = 0; i < n; i++)
	{
		initVisited(n);
		count = BFS(i,n);
		percentage = double(count) / n * 100;
		cout << i + 1 << ": " << fixed << setprecision(2) << percentage << "%";
		if (i != n - 1)
			cout << endl;
	}
	return 0;
}