src/Graph/WarshallFloyd.hpp

View this file on GitHub
Last update: 2020-05-03 20:57:15+09:00
Include: #include "src/Graph/WarshallFloyd.hpp"

Verified with

test/aoj/GRL_1_C.test.cpp

Code

/// @docs src/Graph/WarshallFloyd.md
template <class T> void warshall_floyd(std::vector<std::vector<T>> &d, const T INF) {
    int n = d.size();
    for (int i = 0; i < n; i++) assert(d[i][i] == 0);
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (d[i][k] == INF || d[k][j] == INF) continue;
                d[i][j] = std::min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
}

#line 1 "src/Graph/WarshallFloyd.hpp"
/// @docs src/Graph/WarshallFloyd.md
template <class T> void warshall_floyd(std::vector<std::vector<T>> &d, const T INF) {
    int n = d.size();
    for (int i = 0; i < n; i++) assert(d[i][i] == 0);
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (d[i][k] == INF || d[k][j] == INF) continue;
                d[i][j] = std::min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
}