Concepts3
⚙️AlgorithmAdvanced
Block-Cut Tree
A Block-Cut Tree decomposes an undirected graph into biconnected components (blocks) and articulation points, forming a bipartite tree.
#block-cut tree#biconnected components#articulation points+11
⚙️AlgorithmAdvanced
Biconnected Components
A biconnected component (block) is a maximal subgraph where removing any single vertex keeps it connected.
#biconnected components#blocks#articulation points+12
⚙️AlgorithmIntermediate
Bridges and Articulation Points
A bridge is an edge whose removal increases the number of connected components; an articulation point is a vertex with the same property.
#bridges#articulation points#cut vertex+12