POJ - 2139 Six Degrees of Cowvin Bacon（图论/无权最短路径BFS）

问题描述
The cows have been making movies lately, so they are ready to play a variant of the famous game “Six Degrees of Kevin Bacon”.

The game works like this: each cow is considered to be zero degrees of separation (degrees) away from herself. If two distinct cows have been in a movie together, each is considered to be one ‘degree’ away from the other. If a two cows have never worked together but have both worked with a third cow, they are considered to be two ‘degrees’ away from each other (counted as: one degree to the cow they’ve worked with and one more to the other cow). This scales to the general case.

The N (2 <= N <= 300) cows are interested in figuring out which cow has the smallest average degree of separation from all the other cows. excluding herself of course. The cows have made M (1 <= M <= 10000) movies and it is guaranteed that some relationship path exists between every pair of cows.

Input
Line 1: Two space-separated integers: N and M
Lines 2..M+1: Each input line contains a set of two or more space-separated integers that describes the cows appearing in a single movie. The first integer is the number of cows participating in the described movie, (e.g., Mi); the subsequent Mi integers tell which cows were.

Output
Line 1: A single integer that is 100 times the shortest mean degree of separation of any of the cows.

Sample Input

4 2
3 1 2 3
2 3 4

Sample Output

100

---

分析：

代码如下：

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std; 
const int maxn = 300+10;
const int INF = 1000000000; 
int N, M;
int d[maxn];
bool known[maxn];
int map[maxn][maxn];

void BFS(int s)
{
    queue<int> q;
    q.push(s);
    d[s] = 0;
    known[s] = true;
    while(!q.empty())
    {
        int u = q.front(); q.pop();
        for(int i=1; i<=N; i++)
        {
            if(known[i] == false && map[u][i])
            {
                known[i] = true;
                d[i] = d[u] + 1;
                q.push(i);
            }
        }
    }
    return;
}
int main()
{
    scanf("%d%d",&N,&M);
    int num;
    int k[5000];
    for(int i=0; i<M; i++)
    {
        scanf("%d",&num);
        for(int i=0; i<num; i++)
        {
            scanf("%d",&k[i]);
        }
        for(int i=0; i<num; i++)
        {
            for(int j=i+1; j<num; j++)
            {
                map[k[i]][k[j]] = 1;
                map[k[j]][k[i]] = 1;
            }
        }
    }
    int Min = INF;
    for(int i=1; i<=N; i++)
    {
        memset(d, 0, sizeof(d));
        memset(known, false, sizeof(known));
        BFS(i);
        int sum = 0;
        for(int i=1; i<=N; i++)
        sum += d[i];
        double ave = (double)sum / (N-1);
        int t = 100 * ave;
        Min = min(Min, t);
    }
    printf("%d\n", Min);
    return 0;
}