HDU 1869 (最短路)

两种最短路径算法的比较：

Dijkstra 算法的编码量是：1277B ，用时：46MS；

Floyd 算法的编码量是：808B ，用时：62MS；

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define INF 0xffffff
#define max 105
int dist[max],map[max][max],n,m;
bool visited[max];
void Dijkstra (int s)
{
    int k=0;
    memset (visited,0,sizeof visited);
    for (int i=0;i<n;i++)
        dist[i] = map[s][i];
    visited[s] = true;
    for (int i=0; i<n; i++)
    {
        int min = INF;
        for (int j=0; j<n; j++)
        {
            if (!visited[j] && dist[j] < min)
            {
                min = dist[j];
                k = j;
            }
        }
        visited[k] = true;
        for (int p=0; p<n; p++)
        {
            if (!visited[p] && map[k][p]!=INF)
            {
                int tmp = dist[k]+map[k][p];
                if (tmp < dist[p])
                    dist[p] = tmp;
            }
        }
    }
}
int main ()
{
#ifndef ONLINE_JUDGE
    freopen ("in.txt","r",stdin);
#endif
    while (cin >>n >>m)
    {
        int a,b;
        for (int i=0;i<n-1;i++)
            for (int j=i+1;j<n;j++)
                map[i][j] = map[j][i] = INF;
        for (int i=0;i<n;i++)
            map[i][i] = 0;
        while (m--)
        {
            cin >>a >>b;
            map[a][b] = map[b][a] = 1;
        }
        bool tag = false;
        for (int i=0; i<n-1; i++)
        {
            Dijkstra (i);
            for (int j=i+1; j<n; j++)
                if (dist[j] > 7)
                {
                    tag = true;
                    break;
                }
            if (tag)
                break;
        }
        if (tag)
            puts ("No");
        else
            puts ("Yes");
    }
    return 0;
}

#include <cstdio>
#define INF 0xffffff
#define max 101
int dist[max][max],n;
void Floyd ()
{
    for (int k=0;k<n;k++)
        for (int i=0;i<n;i++)
            for (int j=0;j<n;j++)
                if (dist[i][j] > dist[i][k]+dist[k][j])
                    dist[i][j] = dist[i][k]+dist[k][j];
}
void init ()
{
    for (int i=0;i<n-1;i++)
        for (int j=i+1;j<n;j++)
            dist[i][j] = dist[j][i] = INF;

    for (int i=0;i<n;i++)
        dist[i][i] = 0;
}
bool fun ()
{
    for (int i=0;i<n-1;i++)
        for (int j=i+1;j<n;j++)
            if (dist[i][j] > 7)
                return false;
    return true;
}

int main ()
{
    int m;
    while (~scanf ("%d%d",&n,&m))
    {
        int a,b;
        init ();
        while (m--)
        {
            scanf ("%d%d",&a,&b);
            dist[a][b] = dist[b][a] = 1;
        }
        Floyd ();
        if (fun ())
            puts ("Yes");
        else
            puts ("No");
    }
    return 0;
}