Rare
0/10
BCCs and 2CCs
Author: Benjamin Qi
Resources | |||
---|---|---|---|
CF | |||
CP2 |
2-Edge-Connected Components
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|---|---|---|---|---|
YS | Easy | Show Sketch |
(implementation)
With DSU
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|---|---|---|---|---|
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
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|---|---|---|---|---|
CSA | Easy | Check CSA |
- SRM 787 1000
Biconnected Components
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|---|---|---|---|---|
CSES | Normal | View Solution |
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 |
---|---|---|---|---|---|
POI | Normal | Show Sketch | |||
APIO | Normal | ||||
POI | Normal | View Solution | |||
DMOJ | Hard | Check DMOJ | |||
CEOI | Hard | External Sol | |||
Plat | Very Hard | External Sol |
Module Progress:
Give Us Feedback on BCCs and 2CCs!
Join the Discussion!
Feel free to voice your thoughts in the comments section.