Concepts5
⚙️AlgorithmIntermediate
Euler Path and Circuit
An Euler path visits every edge exactly once, and an Euler circuit is an Euler path that starts and ends at the same vertex.
#euler path#euler circuit#hierholzer algorithm+12
⚙️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
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
🗂️Data StructureAdvanced
Euler Tour Tree
An Euler Tour Tree represents each rooted tree as a DFS open/close sequence so that every subtree is a single contiguous interval.
#euler tour tree#implicit treap#dynamic forest+11