Concepts3
⚙️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
Tarjan's SCC Algorithm
Tarjan’s algorithm finds all Strongly Connected Components (SCCs) of a directed graph in a single depth-first search using a stack.
#tarjan scc#strongly connected components#low link+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