PTA浙江大学数据结构习题——第七周

图4 哈利·波特的考试

（1）floyd 算法：

#include <iostream>

using namespace std;

const int N = 110, INF = 1e6;

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

void floyd()
{
   
    for (int k = 1; k <= n; k ++)
        for (int i = 1; i <= n; i ++)
            for (int j = 1; j <= n; j ++)
                d[i][j] = min(d[i][k] + d[k][j], d[i][j]);
}

int main()
{
   
    cin >> n >> m;
    
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= n; j ++)
        {
   
            if (i == j) d[i][j] = 0;
            else    d[i][j] = INF;
        }
    
    while (m --)
    {
   
        int a, b, c;
        cin >> a >> b >> c;
        d[a][b] = min(d[a][b], c);
        d[b][a] = d[a][b];
    }
    
    floyd();
    
    int res = 0, cur = INF;
    for (int i = 1; i <= n; i ++)
    {
   
        int tmp = 0;
        for (int j = 1; j <= n; j ++)
        {
   
            if (i == j) continue;
            tmp = max(tmp, d[i][j]);
        }
        if (tmp < INF && tmp < cur)
        {
   
            res = i;
            cur = tmp;
        }
    }
    
    if (!res)   cout << res << endl;
    else    cout << res << " " << cur << endl;
    
    return 0;
}

（2）dijkstra 算法

#include <iostream>
#include <cstring>

using namespace std;

const int N = 110, INF = 1e6;

int n, m;
int d[N], g[N][N];
bool st[N]