Rare
0/11
BCCs and 2CCs
Author: Benjamin Qi
| Resources | |||
|---|---|---|---|
| CF | |||
| CP2 | |||
2-Edge-Connected Components
(implementation)
With DSU
| Status | Source | Problem Name | Difficulty | Tags | Solution | URL |
|---|---|---|---|---|---|---|
| Plat | Normal | Show TagsMerging | External Sol |
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
- SRM 787 1000
Biconnected Components
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 | Solution | URL |
|---|---|---|---|---|---|---|
| CSES | Easy | Show TagsBCC | ||||
| POI | Normal | Show TagsBCC | Show Sketch | |||
| APIO | Normal | Show TagsBCC | ||||
| POI | Normal | Show TagsBCC | View Solution | |||
| DMOJ | Hard | Show TagsBCC | Check DMOJ | |||
| CEOI | Hard | Show TagsBCC | External Sol | |||
| Plat | Very Hard | Show TagsBCC | External Sol |
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!