graph/graph_000_basic.cpp

• View this file on GitHub
• Last update: 2019-11-22 21:50:52+09:00

Required by

• Cartesian Tree (algorithm/cartesian_tree.cpp)

Verified with

• verifying_test/yosupo/tree/cartesian_tree.test.cpp

Code

// 移動元と行先と辺のコストを記録する構造体

template <typename T = int>
struct Edge {
    int from, to;
    T cost;
    Edge(int s, T d = 1) : to(s), cost(d) {}
    Edge(int f, int s, T d) : from(f), to(s), cost(d) {}

    bool operator<(const Edge &e) const {
        return cost < e.cost;
    }
    bool operator>(const Edge &e) const {
        return cost > e.cost;
    }
};

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

#line 1 "graph/graph_000_basic.cpp"
// 移動元と行先と辺のコストを記録する構造体

template <typename T = int>
struct Edge {
    int from, to;
    T cost;
    Edge(int s, T d = 1) : to(s), cost(d) {}
    Edge(int f, int s, T d) : from(f), to(s), cost(d) {}

    bool operator<(const Edge &e) const {
        return cost < e.cost;
    }
    bool operator>(const Edge &e) const {
        return cost > e.cost;
    }
};

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

Back to top page