library/_internal/graph-base.hpp

• View this file on GitHub
• Last update: 2025-03-03 00:33:48+09:00
• Include: #include "library/_internal/graph-base.hpp"

Required by

• library/_internal/graph/connection.hpp
• library/_internal/graph/cycle.hpp
• library/_internal/graph/eulerian-walk.hpp
• 有向グラフ (library/data-structure/digraph.hpp)
• 無向グラフ (library/data-structure/graph.hpp)
• 連結判定 (library/graph/connection.hpp)
• サイクル検出 (library/graph/cycle.hpp)
• オイラー路 (library/graph/eulerian-walk.hpp)
• SCC (Strongly Connected Components) (library/graph/scc.hpp)

Verified with

• tests/graph/cycle/libchecker-directed.test.cpp
• tests/graph/cycle/libchecker-undirected.test.cpp
• tests/graph/eulerian-walk/libchecker-directed.test.cpp
• tests/graph/eulerian-walk/libchecker-undirected.test.cpp
• tests/graph/scc/abc256-e.test.cpp
• tests/graph/scc/abc296-e.test.cpp
• tests/graph/scc/libchecker.test.cpp

Code

#pragma once

#include <concepts>
#include <type_traits>
using namespace std;

namespace asalib {
  namespace _internal {
    class graph_base {};
    class notweighted_graph_base: public graph_base {};
    class weighted_graph_base: public graph_base {};

    template<typename T>
    concept is_graph = is_base_of_v<graph_base, T>;

    template<typename T>
    concept notweighted_graph = is_base_of_v<notweighted_graph_base, T>;

    template<typename T>
    concept weighted_graph = is_base_of_v<weighted_graph_base, T>;

    using adjlist_t = vector<vector<pair<size_t, size_t>>>;
    using edgelist_t = vector<pair<size_t, size_t>>;
  }  // namespace _internal
}  // namespace asalib

#line 2 "library/_internal/graph-base.hpp"

#include <concepts>
#include <type_traits>
using namespace std;

namespace asalib {
  namespace _internal {
    class graph_base {};
    class notweighted_graph_base: public graph_base {};
    class weighted_graph_base: public graph_base {};

    template<typename T>
    concept is_graph = is_base_of_v<graph_base, T>;

    template<typename T>
    concept notweighted_graph = is_base_of_v<notweighted_graph_base, T>;

    template<typename T>
    concept weighted_graph = is_base_of_v<weighted_graph_base, T>;

    using adjlist_t = vector<vector<pair<size_t, size_t>>>;
    using edgelist_t = vector<pair<size_t, size_t>>;
  }  // namespace _internal
}  // namespace asalib

Back to top page