Block-cut tree
Contract each BCC to node. Articulation points bridge BCCs. Tree structure of graph's 2-connectivity.
Advertisement
Algorithm
DFS with stack of edges. When articulation point closes a BCC, pop edges from stack until reaching that BCC's edges.
Advertisement
Complexity
O(V+E).
Applications
Circuit design robustness. Network topology analysis. Building block-cut tree for further queries.