cut_nodes

cut_nodes(k)

Identify the cut vertices (articulation nodes) in a planar diagram.

A cut vertex is a node whose removal increases the number of connected components in the diagram. In the context of this function, it detects nodes that belong to multiple faces in the planar diagram.

Parameters:

k (PlanarDiagram) – The planar diagram to analyze.

Returns:

set – A set of nodes that are cut vertices (articulation points) in the diagram.

Return type:

set