Rare
 0/10

BCCs and 2CCs

Author: Benjamin Qi

2-Edge-Connected Components

StatusSourceProblem NameDifficultyTagsSolutionURL
YSEasyShow Sketch

(implementation)

With DSU

StatusSourceProblem NameDifficultyTagsSolutionURL
PlatNormal
Show Tags

Merging

External Sol

The analysis for the above problem mentions an O(mα(n))\mathcal{O}(m\alpha(n)) solution. Although this is not a two-connected component problem, we can in fact use DSU to generate two-connected components.

(explanation?)

Code

Problems

StatusSourceProblem NameDifficultyTagsSolutionURL
CEOIEasyView Solution
  • SRM 787 1000

Biconnected Components

StatusSourceProblem NameDifficultyTagsSolutionURL
CSESNormalView Solution

note that BCCs contain EDGES not VERTICES

Related topics include

  • Articulation Points
  • Bridges
  • Block-Cut Tree

Tutorial

Resources
GFGmaybe not completely correct

(implementation)

Problems

StatusSourceProblem NameDifficultyTagsSolutionURL
POINormalShow Sketch
APIONormal
POINormalView Solution
DMOJHardCheck DMOJ
CEOIHardExternal Sol
PlatVery HardExternal 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!

Give Us Feedback on BCCs and 2CCs!

Leave suggestions for us by making a post on the USACO Forum! Ex: Unclear sections, mislabeled problems, etc.