Floyd算法：各顶点之间最短路径

        非常简单，利用插点法，在边的两个顶点之间插入一个新结点，看是否能够缩短原来两结点之间的距离。

代码实现：

#include <iostream>
using namespace std;
#define maxn 100
#define max_value 0x3f3f3f3f

int dist[maxn][maxn], p[maxn][maxn];

class Graph
{
public:
    int edge[maxn][maxn];
    int vex_num, edge_num;
};

void CreateGraph(Graph& g)
{
    memset(g.edge, max_value, sizeof(g.edge));
    int u, v, w;
    cout << "请输入结点数：" << endl;
    cin >> g.vex_num;
    cout << "请输入边数：" << endl;
    cin >> g.edge_num;
    cout << "请依次输入每条边的两个顶点和权值：" << endl;
    for (int i = 0; i < g.edge_num; i++)
    {
        cin >> u >> v >> w;
        g.edge[u][v] = w;
    }
}

void Floyd(Graph g)
{
    for (int i = 1; i <= g.vex_num; i++)
    {
        for (int j = 1; j <= g.vex_num; j++)
        {
            dist[i][j] = g.edge[i][j];
            if (g.edge[i][j] < max_value)
            {
                p[i][j] = i;
            }
            else
            {
                p[i][j] = -1;
            }
        }
    }
    for (int i = 1; i < g.vex_num; i++)
    {
        dist[i][i] = 0;
    }
    for (int k = 1; k <= g.vex_num; k++)
    {
        for (int i = 1; i <= g.vex_num; i++)
        {
            for (int j = 1; j <= g.vex_num; j++)
            {
                if (dist[i][j] > dist[i][k] + dist[k][j])
                {
                    dist[i][j] = dist[i][k] + dist[k][j];
                    p[i][j] = k;
                }
            }
        }
    }
}

void Print(const int& n)
{
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cout << dist[i][j] << " ";
        }
        cout << endl;
    }
}

int main()
{
    Graph g;
    CreateGraph(g);
    Floyd(g);
    Print(g.vex_num);

    return 0;
}