Skip to main content

Articulation Points

Learn Articulation Points (Graphs, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Articulation Points (Cut Vertices) An articulation point is a vertex whose removal disconnects the graph, for example a router whose failure splits a network. It uses the same DFS with disc and low as bridges. A non-root vertex u is an articulation point if some child v has low[v] >= disc[u] (the child's subtree cannot get above u). The root is one only if it has two or more DFS children . Cost: O(V + E) .

More lessons in Graphs