This is the documentation for the current state of the development branch of rustworkx. The documentation or APIs here can change prior to being released.


articulation_points(graph, /)#

Return the articulation points of an undirected graph.

An articulation point or cut vertex is any node whose removal (along with all its incident edges) increases the number of connected components of a graph. An undirected connected graph without articulation points is biconnected.


The function implicitly assumes that there are no parallel edges or self loops. It may produce incorrect/unexpected results if the input graph has self loops or parallel edges.


PyGraph – The undirected graph to be used.


A set with node indices of the articulation points in the graph.

Return type: