计算在哪一层不创建结点的技巧,非常节省空间,具有思维量。
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
int vertex, edge;
int G[1001][1001];
int flag[1001];
int tail;
void bfs(int i, int n)
{
int last;
int level = 0, count = 1;
flag[i] = 1; last = i;
queue<int>q;
q.push(i);
while (!q.empty())
{
int j = q.front();
q.pop();
for (int s = 1; s <= n; ++s)
{
if (!flag[s] && G[j][s])
{
q.push(s); count++;
flag[s] = 1;
tail = s;
}
}
if (j == last)
{
level++;
last = tail;
}
if (level == 6)
break;
}
printf("%d: %.2f%%\n", i, 100.0 * count / n);
}
int main()
{
int v1, v2;
cin >> vertex >> edge;
for (int i = 0; i < edge; ++i)
{
cin >> v1 >> v2;
G[v1][v2] = 1;
G[v2][v1] = 1;
}
for (int i = 1; i <= vertex; ++i) {
memset(flag, 0, sizeof(flag));
bfs(i, vertex);
}
return 0;
}