Concepts2
⚙️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