cut_set#
This module provides tools for identifying and analyzing (arc) cut sets in planar diagrams.
Ana arc cut set in a graph or diagram is a set of edges (arcs) that, when removed, disconnects the graph into two or more disjoint components. These functions are designed to work with planar diagram representations, allowing the detection of such critical subsets of arcs and vertices.
Functions
|
Find all arc cut sets of size k in a planar diagram. |
|
Identify the cut vertices (articulation nodes) in a planar diagram. |
|
Checks if the given list of arcs forms a cut set in the planar diagram. |