Articulation Points
PropertiesMediumIdentify critical cut-nodes whose deletion disconnects the undirected graph.
Alt+Shift+A
Configuration Panel
Click run to compute cut-vertices. Articulation points are highlighted in yellow on the canvas.
Complexity Mappings
Time ComplexityO(V + E)
Space ComplexityO(V) times tables buffers
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
An Articulation Point (cut vertex) is a node in an undirected graph whose removal (along with all its incident edges) increases the number of connected components.
Algorithm Mechanism
DFS traversal records tin[u] and low[u]. For non-root node u, it is a cut vertex if a child v has low[v] >= tin[u]. For root node, it is a cut vertex if it has >= 2 children.
Source: CP-Algorithms reference guide