Rare
0/11
BCCs and 2CCs
Author: Benjamin Qi
| Resources | |||
|---|---|---|---|
| CF | |||
| CP2 | |||
2-Edge-Connected Components
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| YS | Easy | Show Tags2CC | |||||||
(implementation)
With DSU
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| Plat | Normal | Show TagsMerging | |||||||
The analysis for the above problem mentions an solution. Although this is not a two-connected component problem, we can in fact use DSU to generate two-connected components.
(explanation?)
Code
Problems
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| CEOI | Easy | Show TagsBCC | |||||||
- SRM 787 1000
Biconnected Components
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| CSES | Normal | Show TagsBCC | |||||||
note that BCCs contain EDGES not VERTICES
Related topics include
- Articulation Points
- Bridges
- Block-Cut Tree
Tutorial
| Resources | |||
|---|---|---|---|
| GFG | maybe not completely correct | ||
(implementation)
Problems
| Status | Source | Problem Name | Difficulty | Tags | |||||
|---|---|---|---|---|---|---|---|---|---|
| CSES | Easy | Show TagsBCC | |||||||
| POI | Normal | Show TagsBCC | |||||||
| APIO | Normal | Show TagsBCC | |||||||
| POI | Normal | Show TagsBCC | |||||||
| DMOJ | Hard | Show TagsBCC | |||||||
| CEOI | Hard | Show TagsBCC | |||||||
| Plat | Very Hard | Show TagsBCC | |||||||
Module Progress:
Join the USACO Forum!
Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!