根付き木・逆辺からなる木への変換
(tree/convert-tree.hpp)
Depends on
Required by
Verified with
Code
#pragma once
#include "../graph/graph-template.hpp"
template <typename T>
struct has_cost {
private:
template <typename U>
static auto confirm(U u) -> decltype(u.cost, std::true_type());
static auto confirm(...) -> std::false_type;
public:
enum : bool { value = decltype(confirm(std::declval<T>()))::value };
};
template <typename T>
vector<vector<T>> inverse_tree(const vector<vector<T>>& g) {
int N = (int)g.size();
vector<vector<T>> rg(N);
for (int i = 0; i < N; i++) {
for (auto& e : g[i]) {
if constexpr (is_same<T, int>::value) {
rg[e].push_back(i);
} else if constexpr (has_cost<T>::value) {
rg[e].emplace_back(e.to, i, e.cost);
} else {
assert(0);
}
}
}
return rg;
}
template <typename T>
vector<vector<T>> rooted_tree(const vector<vector<T>>& g, int root = 0) {
int N = (int)g.size();
vector<vector<T>> rg(N);
vector<char> v(N, false);
v[root] = true;
queue<int> que;
que.emplace(root);
while (!que.empty()) {
auto p = que.front();
que.pop();
for (auto& e : g[p]) {
if (v[e] == false) {
v[e] = true;
que.push(e);
rg[p].push_back(e);
}
}
}
return rg;
}
/**
* @brief 根付き木・逆辺からなる木への変換
*/
#line 2 "tree/convert-tree.hpp"
#line 2 "graph/graph-template.hpp"
template <typename T>
struct edge {
int src, to;
T cost;
edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}
edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnweightedGraph = vector<vector<int>>;
// Input of (Unweighted) Graph
UnweightedGraph graph(int N, int M = -1, bool is_directed = false,
bool is_1origin = true) {
UnweightedGraph g(N);
if (M == -1) M = N - 1;
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
if (is_1origin) x--, y--;
g[x].push_back(y);
if (!is_directed) g[y].push_back(x);
}
return g;
}
// Input of Weighted Graph
template <typename T>
WeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,
bool is_1origin = true) {
WeightedGraph<T> g(N);
if (M == -1) M = N - 1;
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
T c;
cin >> c;
if (is_1origin) x--, y--;
g[x].emplace_back(x, y, c);
if (!is_directed) g[y].emplace_back(y, x, c);
}
return g;
}
// Input of Edges
template <typename T>
Edges<T> esgraph([[maybe_unused]] int N, int M, int is_weighted = true,
bool is_1origin = true) {
Edges<T> es;
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
T c;
if (is_weighted)
cin >> c;
else
c = 1;
if (is_1origin) x--, y--;
es.emplace_back(x, y, c);
}
return es;
}
// Input of Adjacency Matrix
template <typename T>
vector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,
bool is_directed = false, bool is_1origin = true) {
vector<vector<T>> d(N, vector<T>(N, INF));
for (int _ = 0; _ < M; _++) {
int x, y;
cin >> x >> y;
T c;
if (is_weighted)
cin >> c;
else
c = 1;
if (is_1origin) x--, y--;
d[x][y] = c;
if (!is_directed) d[y][x] = c;
}
return d;
}
/**
* @brief グラフテンプレート
* @docs docs/graph/graph-template.md
*/
#line 4 "tree/convert-tree.hpp"
template <typename T>
struct has_cost {
private:
template <typename U>
static auto confirm(U u) -> decltype(u.cost, std::true_type());
static auto confirm(...) -> std::false_type;
public:
enum : bool { value = decltype(confirm(std::declval<T>()))::value };
};
template <typename T>
vector<vector<T>> inverse_tree(const vector<vector<T>>& g) {
int N = (int)g.size();
vector<vector<T>> rg(N);
for (int i = 0; i < N; i++) {
for (auto& e : g[i]) {
if constexpr (is_same<T, int>::value) {
rg[e].push_back(i);
} else if constexpr (has_cost<T>::value) {
rg[e].emplace_back(e.to, i, e.cost);
} else {
assert(0);
}
}
}
return rg;
}
template <typename T>
vector<vector<T>> rooted_tree(const vector<vector<T>>& g, int root = 0) {
int N = (int)g.size();
vector<vector<T>> rg(N);
vector<char> v(N, false);
v[root] = true;
queue<int> que;
que.emplace(root);
while (!que.empty()) {
auto p = que.front();
que.pop();
for (auto& e : g[p]) {
if (v[e] == false) {
v[e] = true;
que.push(e);
rg[p].push_back(e);
}
}
}
return rg;
}
/**
* @brief 根付き木・逆辺からなる木への変換
*/
Back to top page
tree/static-top-tree-edge-based.hpp