test/Bridges.test.cpp

• View this file on GitHub
• Last update: 2021-03-21 11:17:59+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_3_B

Depends on

• Graph/LowLink.cpp

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_3_B"
#include "./../Graph/LowLink.cpp"
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	LowLink g(n);
	while (m--) {
		int u, v;
		cin >> u >> v;
		g.add_edge(u, v);
	}

	auto [aps, bridges] = g.build();
	sort(bridges.begin(), bridges.end());
	for (auto [u, v] : bridges) {
		cout << u << ' ' << v << '\n';
	}
}

#line 1 "test/Bridges.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_3_B"
#line 2 "Graph/LowLink.cpp"
#include <vector>
#include <utility>

class LowLink {
	size_t n;
	std::vector<std::vector<int>> graph;
	std::vector<bool> visited;
	std::vector<int> ord, low, articulation_points;
	std::vector<std::pair<int, int>> bridges;
	int k;

	void dfs(int v, int parent) {
		visited[v] = true;
		ord[v] = k++;
		low[v] = ord[v];
		int count = 0;
		bool is_articultion_point = false;
		for (int u : graph[v]) {
			if (!visited[u]) {
				count++;
				dfs(u, v);
				low[v] = std::min(low[v], low[u]);
				if (parent != -1 && ord[v] <= low[u]) {
					is_articultion_point = true;
				}
				if (ord[v] < low[u]) {
					bridges.emplace_back(std::min(v, u), std::max(v, u));
				}
			} else if (u != parent) {
				low[v] = std::min(low[v], ord[u]);
			}
		}
		if (is_articultion_point || (parent == -1 && count > 1)) {
			articulation_points.push_back(v);
		}
	}

public:
	LowLink(size_t _n) : n(_n), graph(_n) {}
	LowLink(const std::vector<std::vector<int>>& _graph) : n(_graph.size()), graph(_graph) {}
	void add_edge(int u, int v) {
		graph[u].push_back(v);
		graph[v].push_back(u);
	}
	auto build() {
		visited.assign(n, false);
		ord.assign(n, 0);
		low.assign(n, 0);
		articulation_points.clear();
		bridges.clear();
		k = 0;
		for (size_t i = 0; i < n; ++i) {
			if (!visited[i]) dfs(i, -1);
		}
		return std::pair(articulation_points, bridges);
	}
};
#line 3 "test/Bridges.test.cpp"
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	LowLink g(n);
	while (m--) {
		int u, v;
		cin >> u >> v;
		g.add_edge(u, v);
	}

	auto [aps, bridges] = g.build();
	sort(bridges.begin(), bridges.end());
	for (auto [u, v] : bridges) {
		cout << u << ' ' << v << '\n';
	}
}

Back to top page