A vertex v in a graph G is an articulation point of G if removing it and its incident edges increases the number of connected components of G.
ArticulationPoints(G) returns a list of the vertices of G which are articulation points.
The articulation points of a graph can be computed when traversing the graph using depth-first-search in linear time in the size of the graph.
P5 ≔ PathGraph⁡5
P5≔Graph 1: an undirected unweighted graph with 5 vertices and 4 edge(s)
G ≔ DeleteVertex⁡P5,3
G≔Graph 2: an undirected unweighted graph with 4 vertices and 2 edge(s)
C5 ≔ CycleGraph⁡5
C5≔Graph 3: an undirected unweighted graph with 5 vertices and 5 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)