Floyd算法（C/C++）

最新推荐文章于 2024-06-17 13:30:52 发布

想要个小姑娘

最新推荐文章于 2024-06-17 13:30:52 发布

阅读量126

点赞数

分类专栏：数据结构与算法文章标签： c++

本文链接：https://blog.csdn.net/qq_44998513/article/details/116092818

版权

数据结构与算法专栏收录该内容

10 篇文章 0 订阅

订阅专栏

/* 输入 */（有向图）
7 12     // 顶点数、边数
0 1 2    // 边的两个顶点、边的权重
0 3 1
1 3 3
1 4 10
2 0 4
2 5 5
3 2 2
3 4 2
3 5 8
3 6 4
4 6 6
6 5 1
/* 输出 */
from 0 to 5: 0->3->6->5
The shortest dist matrix:
         0          2          3          1          3          6          5     
         9          0          5          3          5          8          7     
         4          6          0          5          7          5          9     
         6          8          2          0          2          5          4     
2147483647 2147483647 2147483647 2147483647          0          7          6     
2147483647 2147483647 2147483647 2147483647 2147483647          0 2147483647 
2147483647 2147483647 2147483647 2147483647 2147483647          1          0

#include <iostream>
#include <vector>
#include <iomanip>
/**
 * 图的多源最小路径（Floyd算法）
 * 存储结构：邻接矩阵
 * 图的性质：有权图、有向图
 **/

std::vector<std::vector<int>> buildGraph(int, int);
std::pair<std::vector<std::vector<int>>, std::vector<std::vector<int>>>
Floyd(const std::vector<std::vector<int>> &);
void printDist(const std::vector<std::vector<int>> &);
void printPath(const std::vector<std::vector<int>> &, int, int);
void print(std::pair<std::vector<std::vector<int>>, std::vector<std::vector<int>>>, int, int);
int main()
{
    int vertexNum, edgeNum;
    std::cin >> vertexNum >> edgeNum;
    std::vector<std::vector<int>> graph{buildGraph(vertexNum, edgeNum)};

    auto shortestPair{Floyd(graph)};

    print(shortestPair, 0, 5);

    return 0;
}
std::vector<std::vector<int>> buildGraph(int vertexNum, int edgeNum)
{
    std::vector<std::vector<int>> graph(vertexNum, std::vector<int>(vertexNum, __INT_MAX__));
    for (int v1, v2, weight, i = 0; i != edgeNum; ++i)
    {
        std::cin >> v1 >> v2 >> weight;
        graph[v1][v2] = weight;
    }
    for (int i = 0 ; i != vertexNum; ++i)
        graph[i][i] = 0;
    return graph;
}
std::pair<std::vector<std::vector<int>>, std::vector<std::vector<int>>>
Floyd(const std::vector<std::vector<int>> &graph)
{
    std::vector<std::vector<int>> dist{graph}, path(graph.size(), std::vector<int>(graph.size(), -1));
    for (int k = 0; k != graph.size(); ++k)
        for (int i = 0; i != graph.size(); ++i)
            for (int j = 0; j != graph.size(); ++j)
                if (dist[i][k] + dist[k][j] < dist[i][j] && dist[i][k] != __INT_MAX__ && dist[k][j] != __INT_MAX__)
                {
                    dist[i][j] = dist[i][k] + dist[k][j];
                    path[i][j] = k;
                }
                    
    return std::pair<std::vector<std::vector<int>>, std::vector<std::vector<int>>>{path, dist};
}
void print(std::pair<std::vector<std::vector<int>>, std::vector<std::vector<int>>> shortestPair, int row, int col)
{
    std::cout << "from " << row << " to " << col << ": ";
    std::cout << row << "->";
    printPath(shortestPair.first, row, col);
    std::cout << col << "\n";
    std::cout << "The shortest dist matrix:\n";
    printDist(shortestPair.second);
}
void printDist(const std::vector<std::vector<int>> &dist)
{
    for (const auto &c : dist)
    {
        for (const int &d : c)
            std::cout << std::setw(10) << d << " ";
        std::cout << "\n";
    }
}
void printPath(const std::vector<std::vector<int>> &path, int row, int col)
{
    if (path[row][col] == -1)
        return;
    printPath(path, row, path[row][col]);
    std::cout << path[row][col] << "->";
    printPath(path, path[row][col], col);
}