graph/graph_template.hpp

• View this file on GitHub
• Last update: 2024-01-25 10:46:02+09:00
• Include: #include "graph/graph_template.hpp"

Required by

• Traveling Salesman Problem (巡回セールスマン問題) (dp/traveling_salesman_problem.hpp)
• Bellman-Ford algorithm (ベルマンフォード法) (graph/bellman_ford.hpp)
• Dijkstra's algorithm (ダイクストラ法) (graph/dijkstra.hpp)
• Euler Tour (オイラーツアー) (graph/euler_tour.hpp)
• graph/get_edges.hpp
• Kruskal's algorithm (クラスカル法) (graph/kruskal.hpp)
• Low Link (関節点・橋) (graph/low_link.hpp)
• Lowest Common Ancestor (最小共通祖先) (graph/lowest_common_ancestor.hpp)
• graph/read_graph.hpp
• Strongly Connected Component (強連結成分) (graph/strongly_connected_component.hpp)
• Topological Sort (トポロジカルソート) (graph/topological_sort.hpp)
• Tree Diameter (木の直径) (graph/tree_diameter.hpp)
• 01-BFS (graph/zero_one_bfs.hpp)

Verified with

• verify/aoj_dpl/aoj_dpl_2_a.test.cpp
• verify/aoj_grl/aoj_grl_1_b.test.cpp
• verify/aoj_grl/aoj_grl_2_a.test.cpp
• verify/aoj_grl/aoj_grl_3_a.test.cpp
• verify/aoj_grl/aoj_grl_3_b.test.cpp
• verify/lc_graph/lc_scc.test.cpp
• verify/lc_graph/lc_shortest_path_dijkstra.test.cpp
• verify/lc_tree/lc_lowest_common_ancestor.test.cpp
• verify/lc_tree/lc_tree_diameter.test.cpp

Code

#pragma once

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

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

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

template <class T> using Edges = std::vector<Edge<T>>;
template <class T> using Graph = std::vector<std::vector<Edge<T>>>;

#line 2 "graph/graph_template.hpp"

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

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

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

template <class T> using Edges = std::vector<Edge<T>>;
template <class T> using Graph = std::vector<std::vector<Edge<T>>>;

Back to top page