Concepts2
⚙️AlgorithmIntermediate
Bridge Tree
A bridge tree is built by contracting every 2-edge-connected component of an undirected graph into a single node, leaving only bridges as edges between nodes.
#bridge tree#2-edge-connected components#bridges+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