graph/graph-template.hpp

• View this file on GitHub
• Last update: 2024-07-29 11:05:40+08:00
• Include: #include "graph/graph-template.hpp"

Required by

• graph/bipartite-graph/bipartite-graph.hpp
• graph/connected-components/bi-connectd-components.hpp
• graph/connected-components/strongly-connected-components.hpp
• graph/connected-components/two-edge-connected-components.hpp
• graph/others/block-cut-tree.hpp
• graph/others/low-link.hpp
• graph/shortest-path/bellman-ford.hpp
• graph/shortest-path/dijkstra.hpp
• graph/tree/doubling-lowest-common-ancestor.hpp
• graph/tree/heavy-light-decomposition.hpp
• graph/tree/rmq-lowest-common-ancestor.hpp
• graph/tree/union-find-lowest-common-ancestor.hpp
• Virtual Tree (graph/tree/virtual-tree.hpp)

Verified with

• test/aoj-3022.test.cpp
• test/aoj-grl-1-a.test.cpp
• test/aoj-grl-1-b.test.cpp
• test/aoj-grl-3-a.test.cpp
• test/aoj-grl-3-b.test.cpp
• test/aoj-grl-3-c.test.cpp
• test/aoj-grl-5-c-2.test.cpp
• test/aoj-grl-5-c-3.test.cpp
• test/aoj-grl-5-c-4.test.cpp
• test/aoj-grl-5-c.test.cpp
• test/yosupo-scc.test.cpp
• test/yosupo-two-edge-connected-components.test.cpp
• test/yosupo-vertex-set-path-composite.test.cpp

Code

#pragma once
#include <bits/stdc++.h>
using namespace std;

template <typename T = int>
struct Edge {
    int from, to;
    T cost;
    int idx;

    Edge() = default;

    Edge(int from, int to, T cost = 1, int idx = -1)
        : from(from), to(to), cost(cost), idx(idx) {}

    operator int() const { return to; }
};

template <typename T = int>
struct Graph {
    vector<vector<Edge<T> > > g;
    int es;

    Graph() = default;

    explicit Graph(int n) : g(n), es(0) {}

    size_t size() const { return g.size(); }

    virtual void add_directed_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es++);
    }

    // virtual 可以被重载，实现多态
    virtual void add_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es);
        g[to].emplace_back(to, from, cost, es++);
    }

    void read(int M, int padding = -1, bool weighted = false,
              bool directed = false) {
        for (int i = 0; i < M; i++) {
            int a, b;
            cin >> a >> b;
            a += padding;
            b += padding;
            T c = T(1);
            if (weighted) cin >> c;
            if (directed)
                add_directed_edge(a, b, c);
            else
                add_edge(a, b, c);
        }
    }

    inline vector<Edge<T> > &operator[](const int &k) { return g[k]; }

    inline const vector<Edge<T> > &operator[](const int &k) const { return g[k]; }
};

template <typename T = int>
using Edges = vector<Edge<T> >;

#line 2 "graph/graph-template.hpp"
#include <bits/stdc++.h>
using namespace std;

template <typename T = int>
struct Edge {
    int from, to;
    T cost;
    int idx;

    Edge() = default;

    Edge(int from, int to, T cost = 1, int idx = -1)
        : from(from), to(to), cost(cost), idx(idx) {}

    operator int() const { return to; }
};

template <typename T = int>
struct Graph {
    vector<vector<Edge<T> > > g;
    int es;

    Graph() = default;

    explicit Graph(int n) : g(n), es(0) {}

    size_t size() const { return g.size(); }

    virtual void add_directed_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es++);
    }

    // virtual 可以被重载，实现多态
    virtual void add_edge(int from, int to, T cost = 1) {
        g[from].emplace_back(from, to, cost, es);
        g[to].emplace_back(to, from, cost, es++);
    }

    void read(int M, int padding = -1, bool weighted = false,
              bool directed = false) {
        for (int i = 0; i < M; i++) {
            int a, b;
            cin >> a >> b;
            a += padding;
            b += padding;
            T c = T(1);
            if (weighted) cin >> c;
            if (directed)
                add_directed_edge(a, b, c);
            else
                add_edge(a, b, c);
        }
    }

    inline vector<Edge<T> > &operator[](const int &k) { return g[k]; }

    inline const vector<Edge<T> > &operator[](const int &k) const { return g[k]; }
};

template <typename T = int>
using Edges = vector<Edge<T> >;

Back to top page