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
🗂️Data StructureAdvanced
Centroid Decomposition
Centroid decomposition splits a tree around a special node (centroid) so that every remaining component has at most half the nodes.
#centroid decomposition#centroid tree#tree algorithms+11