library/_internal/graph/cycle.hpp

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

Depends on

• library/_internal/graph-base.hpp
• 無向グラフ (library/data-structure/graph.hpp)

Required by

• サイクル検出 (library/graph/cycle.hpp)

Verified with

• tests/graph/cycle/libchecker-directed.test.cpp
• tests/graph/cycle/libchecker-undirected.test.cpp

Code

#pragma once

#include <cassert>
#include <functional>
#include <optional>
#include <stack>
#include <utility>
#include <vector>
using namespace std;

#include "../../data-structure/graph.hpp"

namespace asalib {
  namespace _internal {
    namespace graph {
      template<bool is_directed>
      optional<pair<vector<size_t>, vector<size_t>>> cycleDetection(const size_t& n_vertex, const size_t& n_edge, const adjlist_t& adj_list, const edgelist_t& edge_list) {
        vector<bool> visited(n_vertex, false);
        vector<bool> finished(n_vertex, false);
        vector<bool> used(n_edge, false);
        stack<size_t> st;
        size_t base_point = -1;

        function<bool(size_t)> dfs = [&](size_t v) -> bool {
          visited[v] = true;
          for (auto [to, edge_id] : adj_list[v]) {
            if (used[edge_id]) continue;
            used[edge_id] = true;
            st.push(edge_id);
            if (!finished[to] && visited[to]) {
              base_point = to;
              return true;
            }
            if (!visited[to] && dfs(to)) return true;
            st.pop();
            used[edge_id] = false;
          }
          finished[v] = true;
          return false;
        };

        for (size_t i = 0; i < n_vertex; ++i) {
          if (!visited[i]) {
            if (dfs(i)) {
              size_t v = base_point;
              vector<size_t> edges, verts;
              while (!st.empty()) {
                size_t edge_id = st.top();
                st.pop();
                edges.push_back(edge_id);
                if constexpr (is_directed) {
                  assert(edge_list[edge_id].second == v);
                  v = edge_list[edge_id].first;
                }
                else {
                  assert(edge_list[edge_id].first == v || edge_list[edge_id].second == v);
                  v = (edge_list[edge_id].first == v ? edge_list[edge_id].second : edge_list[edge_id].first);
                }
                verts.push_back(v);
                if (v == base_point) break;
              }
              reverse(verts.begin(), verts.end());
              reverse(edges.begin(), edges.end());
              assert(verts.size() == edges.size());
              assert(verts[0] == base_point);
              return make_pair(verts, edges);
            }
          }
        }
        return nullopt;
      }
    }  // namespace graph
  }  // namespace _internal
}  // namespace asalib

#line 2 "library/_internal/graph/cycle.hpp"

#include <cassert>
#include <functional>
#include <optional>
#include <stack>
#include <utility>
#include <vector>
using namespace std;

#line 2 "library/data-structure/graph.hpp"

#line 6 "library/data-structure/graph.hpp"
using namespace std;

#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
#line 9 "library/data-structure/graph.hpp"

namespace asalib {
  namespace graph {
    class graph: public _internal::notweighted_graph_base {
      public:
      graph(): n_vertex(0), n_edge(0) {}
      explicit graph(size_t n_vertex): n_vertex(n_vertex), n_edge(0) {
        adj_list.reserve(n_vertex);
        adj_list.resize(n_vertex);
      }

      void add_edge(size_t v1, size_t v2) {
        assert(0 <= v1 && v1 < n_vertex);
        assert(0 <= v2 && v2 < n_vertex);
        adj_list[v1].push_back({ v2, n_edge });
        adj_list[v2].push_back({ v1, n_edge });
        edge_list.push_back({ v1, v2 });
        ++n_edge;
      }

      // (v1, v2)
      pair<size_t, size_t> get_edge(size_t edgeId) const {
        assert(0 <= edgeId && edgeId < n_edge);
        return edge_list[edgeId];
      }

      // (v2, edgeId)
      vector<pair<size_t, size_t>> get_adj(size_t vertex) const {
        assert(0 <= vertex && vertex < n_vertex);
        return adj_list[vertex];
      }

      // ---------- prototype ---------- //
      optional<pair<vector<size_t>, vector<size_t>>> cycle() const;
      bool is_connected() const;
      optional<pair<vector<size_t>, vector<size_t>>> eulerian_walk() const;

      private:
      size_t n_vertex, n_edge;
      asalib::_internal::adjlist_t adj_list;
      asalib::_internal::edgelist_t edge_list;
    };
  }  // namespace graph
}  // namespace asalib
#line 12 "library/_internal/graph/cycle.hpp"

namespace asalib {
  namespace _internal {
    namespace graph {
      template<bool is_directed>
      optional<pair<vector<size_t>, vector<size_t>>> cycleDetection(const size_t& n_vertex, const size_t& n_edge, const adjlist_t& adj_list, const edgelist_t& edge_list) {
        vector<bool> visited(n_vertex, false);
        vector<bool> finished(n_vertex, false);
        vector<bool> used(n_edge, false);
        stack<size_t> st;
        size_t base_point = -1;

        function<bool(size_t)> dfs = [&](size_t v) -> bool {
          visited[v] = true;
          for (auto [to, edge_id] : adj_list[v]) {
            if (used[edge_id]) continue;
            used[edge_id] = true;
            st.push(edge_id);
            if (!finished[to] && visited[to]) {
              base_point = to;
              return true;
            }
            if (!visited[to] && dfs(to)) return true;
            st.pop();
            used[edge_id] = false;
          }
          finished[v] = true;
          return false;
        };

        for (size_t i = 0; i < n_vertex; ++i) {
          if (!visited[i]) {
            if (dfs(i)) {
              size_t v = base_point;
              vector<size_t> edges, verts;
              while (!st.empty()) {
                size_t edge_id = st.top();
                st.pop();
                edges.push_back(edge_id);
                if constexpr (is_directed) {
                  assert(edge_list[edge_id].second == v);
                  v = edge_list[edge_id].first;
                }
                else {
                  assert(edge_list[edge_id].first == v || edge_list[edge_id].second == v);
                  v = (edge_list[edge_id].first == v ? edge_list[edge_id].second : edge_list[edge_id].first);
                }
                verts.push_back(v);
                if (v == base_point) break;
              }
              reverse(verts.begin(), verts.end());
              reverse(edges.begin(), edges.end());
              assert(verts.size() == edges.size());
              assert(verts[0] == base_point);
              return make_pair(verts, edges);
            }
          }
        }
        return nullopt;
      }
    }  // namespace graph
  }  // namespace _internal
}  // namespace asalib

Back to top page