Floyd最短路算法

码字不容易啊，转载麻烦注明出处
【一周一算法】算法6：只有五行的Floyd最短路算法
http://bbs.ahalei.com/thread-4554-1-1.html
(出处: 啊哈磊_编程从这里起步)

C - Six Degrees of Cowvin Bacon
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit

Status
use MathJax to parse formulas
Description

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
Hint

[Cow 3 has worked with all the other cows and thus has degrees of separation: 1, 1, and 1 – a mean of 1.00 .]

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 310
#define MAX 0x3f3f3f3f
int map[10010][310];
void Floyd(int n)
{
    int i,j,k;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            for(k=1;k<=n;k++)
            {
                if(map[j][k]>map[j][i]+map[i][k])
                    map[j][k] = map[k][j] = map[j][i]+map[i][k];
            }
        }
    }
}
int main()
{
    int n,m;
    int i,j;
    int dis[N];
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        memset(map,MAX,sizeof(map));
        for(i=0;i<=n;i++)
        {
            map[i][i] = map[i][0] = 0;
        }
        while(m--)
        {
            int num;
            scanf("%d",&num);
            for(i=0;i<num;i++)
            {
                scanf("%d",&dis[i]);
                for(j=0;j<i;j++)
                {
                    map[dis[i]][dis[j]] = map[dis[j]][dis[i]] = 1;
                }
            }
        }
        Floyd(n);
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                map[i][0]+=map[i][j];
            }
        }
        int min = map[1][0];
        for(i=1;i<=n;i++)
        {
            if(map[i][0]<min)
                min = map[i][0];
        }
        printf("%d\n",min*100/(n-1));
    }
    return 0;
}