Floyd模板

比较简单的算法：但是当点太多需要剪枝，不然很耗时

void Floyd()
{
    for(int k=;k<n;++k)
        for(int i=;i<n;++i)
            for(int j=;j<n;++j)
                    dj[i][j] = min(dj[i][j],dj[i][k]+dj[k][j]);
}

hdu1869

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define N   (110)

int dj[N][N];
int n,m;

void Floyd()
{
    for(int k=;k<n;++k)
        for(int i=;i<n;++i)
            for(int j=;j<n;++j)
                    dj[i][j] = min(dj[i][j],dj[i][k]+dj[k][j]);
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=;i<N;++i)
            for(int j=;j<N;++j)
            {
                if(i != j) dj[i][j] = INF;
                else dj[i][j] = ;
            }
        for(int i=;i<m;++i)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            if(a != b) dj[a][b] = dj[b][a] = ;
        }
        Floyd();
        bool flag = true;
        for(int i=;i<n;++i)
            for(int j=;j<n;++j)
                if(dj[i][j] > )
                {
                    flag =false;
                    break;
                }
        if(flag) printf("Yes\n");
        else printf("No\n");
    }
    return ;
}