rcpl

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub ruthen71/rcpl

:heavy_check_mark: Bellman-Ford algorithm (ベルマンフォード法)
(graph/bellman_ford.hpp)

使い方

Graph<T> g;
std::vector<int> s = {0};   // 始点の集合
const T INF;
auto [dist, par, root] = bellman_ford(g, s, INF);

dist[i] について

参考文献

Depends on

Verified with

Code

#pragma once

#include "graph/graph_template.hpp"

#include <tuple>

// {dist, par, root}
template <class T> std::tuple<std::vector<T>, std::vector<int>, std::vector<int>> bellman_ford(Graph<T>& g, std::vector<int>& s, const T inf) {
    const int n = (int)(g.size());
    std::vector<T> dist(n, inf);
    std::vector<int> par(n, -1), root(n, -1);

    for (auto&& v : s) {
        dist[v] = 0;
        root[v] = v;
    }
    int loop_count = 0;

    while (true) {
        loop_count++;
        bool update = false;
        for (int cur = 0; cur < n; cur++) {
            if (dist[cur] == inf) continue;
            for (auto&& e : g[cur]) {
                T nd = std::max(-inf, dist[cur] + e.cost);
                if (dist[e.to] > nd) {
                    par[e.to] = cur;
                    root[e.to] = root[cur];
                    update = true;
                    if (loop_count >= n) nd = -inf;
                    dist[e.to] = nd;
                }
            }
        }
        if (!update) break;
    }
    return {dist, par, root};
}
#line 2 "graph/bellman_ford.hpp"

#line 2 "graph/graph_template.hpp"

#include <vector>
#include <cassert>

template <class T> struct Edge {
    int from, to;
    T cost;
    int id;

    Edge() = default;
    Edge(const int from, const int to, const T cost = T(1), const int id = -1) : from(from), to(to), cost(cost), id(id) {}

    friend bool operator<(const Edge<T>& a, const Edge<T>& b) { return a.cost < b.cost; }

    friend std::ostream& operator<<(std::ostream& os, const Edge<T>& e) {
        // output format: {id: cost(from, to) = cost}
        return os << "{" << e.id << ": cost(" << e.from << ", " << e.to << ") = " << e.cost << "}";
    }
};
template <class T> using Edges = std::vector<Edge<T>>;

template <class T> struct Graph {
    struct EdgeIterators {
       public:
        using Iterator = typename std::vector<Edge<T>>::iterator;
        EdgeIterators() = default;
        EdgeIterators(const Iterator& begit, const Iterator& endit) : begit(begit), endit(endit) {}
        Iterator begin() const { return begit; }
        Iterator end() const { return endit; }
        size_t size() const { return std::distance(begit, endit); }
        Edge<T>& operator[](int i) const { return begit[i]; }

       private:
        Iterator begit, endit;
    };

    int n, m;
    bool is_build, is_directed;
    std::vector<Edge<T>> edges;

    // CSR (Compressed Row Storage) 形式用
    std::vector<int> start;
    std::vector<Edge<T>> csr_edges;

    Graph() = default;
    Graph(const int n, const bool directed = false) : n(n), m(0), is_build(false), is_directed(directed), start(n + 1, 0) {}

    // 辺を追加し, その辺が何番目に追加されたかを返す
    int add_edge(const int from, const int to, const T cost = T(1), int id = -1) {
        assert(!is_build);
        assert(0 <= from and from < n);
        assert(0 <= to and to < n);
        if (id == -1) id = m;
        edges.emplace_back(from, to, cost, id);
        return m++;
    }

    // CSR 形式でグラフを構築
    void build() {
        assert(!is_build);
        for (auto&& e : edges) {
            start[e.from + 1]++;
            if (!is_directed) start[e.to + 1]++;
        }
        for (int v = 0; v < n; v++) start[v + 1] += start[v];
        auto counter = start;
        csr_edges.resize(start.back() + 1);
        for (auto&& e : edges) {
            csr_edges[counter[e.from]++] = e;
            if (!is_directed) csr_edges[counter[e.to]++] = Edge(e.to, e.from, e.cost, e.id);
        }
        is_build = true;
    }

    EdgeIterators operator[](int i) {
        if (!is_build) build();
        return EdgeIterators(csr_edges.begin() + start[i], csr_edges.begin() + start[i + 1]);
    }

    size_t size() const { return (size_t)(n); }

    friend std::ostream& operator<<(std::ostream& os, Graph<T>& g) {
        os << "[";
        for (int i = 0; i < (int)(g.size()); i++) {
            os << "[";
            for (int j = 0; j < (int)(g[i].size()); j++) {
                os << g[i][j];
                if (j + 1 != (int)(g[i].size())) os << ", ";
            }
            os << "]";
            if (i + 1 != (int)(g.size())) os << ", ";
        }
        return os << "]";
    }
};
#line 4 "graph/bellman_ford.hpp"

#include <tuple>

// {dist, par, root}
template <class T> std::tuple<std::vector<T>, std::vector<int>, std::vector<int>> bellman_ford(Graph<T>& g, std::vector<int>& s, const T inf) {
    const int n = (int)(g.size());
    std::vector<T> dist(n, inf);
    std::vector<int> par(n, -1), root(n, -1);

    for (auto&& v : s) {
        dist[v] = 0;
        root[v] = v;
    }
    int loop_count = 0;

    while (true) {
        loop_count++;
        bool update = false;
        for (int cur = 0; cur < n; cur++) {
            if (dist[cur] == inf) continue;
            for (auto&& e : g[cur]) {
                T nd = std::max(-inf, dist[cur] + e.cost);
                if (dist[e.to] > nd) {
                    par[e.to] = cur;
                    root[e.to] = root[cur];
                    update = true;
                    if (loop_count >= n) nd = -inf;
                    dist[e.to] = nd;
                }
            }
        }
        if (!update) break;
    }
    return {dist, par, root};
}
Back to top page