图的所有节点对之间的最短路径—Floyd算法(C++)

Dijkstra算法之后是Floyd算法
Dijkstra算法是求单源最短路径(即固定起点，不固定终点)
Floyd算法是求任意点对之间的最短路径(起点和终点都任意)

Floyd算法也叫Floyd-Warshall算法
时间复杂度O(N^3)，N为图中节点的数目

#include <iostream>
#include <vector>

using namespace std;

typedef int DATA_TYPE;  // 权值为int型
const DATA_TYPE NO_EDGE = 10000000;  // 表示没有该边

// 图的结构体定义
struct MatrixGraph
{
    vector<vector<DATA_TYPE> > weights;
    int vertexNum;  // 其实定义了邻接矩阵，这个也可以省
};

// 路径格式转换(从点对链接式转换到序列式)
// 结果保存到visitPath中
void getVisitPath(vector<vector<int> > path, vector<int> &visitPath, int startNode, int endNode)
{
    int k = path[startNode][endNode];
    if (k == -1)
    {
        return;
    }
    else
    {
        getVisitPath(path, visitPath, startNode, k);
        visitPath.push_back(k);
        getVisitPath(path, visitPath, k, endNode);
    }
}

// 输出所有节点对之间的最短路径
void displayPath(vector<vector<DATA_TYPE> > distance, vector<vector<int> > path)
{
    for (size_t i = 0; i < path.size(); ++i)
    {
        for (size_t j = 0; j < path.size(); ++j)
        {
            // 排除自己和自己 以及 不可达的路径
            if (i != j && distance[i][j] < NO_EDGE)
            {
                vector<int> visitPath;
                getVisitPath(path, visitPath, i, j);
                //包含头尾的完整路径
                //visitPath.insert(visitPath.begin(), i);
                //visitPath.push_back(j);
                cout << "From " << i << " to " << j << "||  ";
                cout << "Distance: " << distance[i][j] << "  ||  Path:  ";
                cout << i << "->";

                for (size_t k = 0; k < visitPath.size(); ++k)
                {
                    cout << visitPath[k] << "->";
                }
                cout << j << endl;
            }
        }
        cout << endl;
    }
}

// Floyd算法
vector<vector<DATA_TYPE> > floyd(vector<vector<DATA_TYPE> > weights)
{
    int vertexNum = weights.size();
    vector<vector<DATA_TYPE> > distance = weights;  // 节点之间的最短路径
    vector<vector<int> > path(vertexNum, vector<int>(vertexNum, -1));  // 访问路径

    for (size_t k = 0; k < vertexNum; ++k)
    {
        for (size_t i = 0; i < vertexNum; ++i)
        {
            for (size_t j = 0; j < vertexNum; ++j)
            {
                if (distance[i][j] > distance[i][k] + distance[k][j])
                {
                    distance[i][j] = distance[i][k] + distance[k][j];
                    path[i][j] = k;
                }
            }
        }
    }

    // 输出路径情况
    displayPath(distance, path);

    return distance;
}


int main() {

    // 图的初始化
    // 顶点编号必须为从0开始的连续的整数(若不是，先转换)
    // 图为有向图
    MatrixGraph graph;

    graph.vertexNum = 7;  // 定义了邻接矩阵 这个可以省
    graph.weights.push_back(vector<DATA_TYPE>{0, 4, 6, 6, NO_EDGE, NO_EDGE, NO_EDGE});
    graph.weights.push_back(vector<DATA_TYPE>{NO_EDGE, 0, 1, NO_EDGE, 7, NO_EDGE, NO_EDGE});
    graph.weights.push_back(vector<DATA_TYPE>{NO_EDGE, NO_EDGE, 0, NO_EDGE, 6, 4, NO_EDGE});
    graph.weights.push_back(vector<DATA_TYPE>{NO_EDGE, NO_EDGE, 2, 0, NO_EDGE, 5, NO_EDGE});
    graph.weights.push_back(vector<DATA_TYPE>{NO_EDGE, NO_EDGE, NO_EDGE, NO_EDGE, 0, NO_EDGE, 6});
    graph.weights.push_back(vector<DATA_TYPE>{NO_EDGE, NO_EDGE, NO_EDGE, NO_EDGE, 1, 0, 8});
    graph.weights.push_back(vector<DATA_TYPE>{NO_EDGE, NO_EDGE, NO_EDGE, NO_EDGE, NO_EDGE, NO_EDGE, 0});

    vector<vector<DATA_TYPE> > distance = floyd(graph.weights);

    return 0;
}

测试用例图如下：

编译环境(CLion 2016 with MinGW G++, GDB 7.11)

输出结果：
From 0 to 1|| Distance: 4 || Path: 0->1
From 0 to 2|| Distance: 5 || Path: 0->1->2
From 0 to 3|| Distance: 6 || Path: 0->3
From 0 to 4|| Distance: 10 || Path: 0->1->2->5->4
From 0 to 5|| Distance: 9 || Path: 0->1->2->5
From 0 to 6|| Distance: 16 || Path: 0->1->2->5->4->6

From 1 to 2|| Distance: 1 || Path: 1->2
From 1 to 4|| Distance: 6 || Path: 1->2->5->4
From 1 to 5|| Distance: 5 || Path: 1->2->5
From 1 to 6|| Distance: 12 || Path: 1->2->5->4->6

From 2 to 4|| Distance: 5 || Path: 2->5->4
From 2 to 5|| Distance: 4 || Path: 2->5
From 2 to 6|| Distance: 11 || Path: 2->5->4->6

From 3 to 2|| Distance: 2 || Path: 3->2
From 3 to 4|| Distance: 6 || Path: 3->5->4
From 3 to 5|| Distance: 5 || Path: 3->5
From 3 to 6|| Distance: 12 || Path: 3->5->4->6

From 4 to 6|| Distance: 6 || Path: 4->6

From 5 to 4|| Distance: 1 || Path: 5->4
From 5 to 6|| Distance: 7 || Path: 5->4->6