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.

We need arc cut sets for these operations: - detecting connected sus - detecting 3-sums - tangle decomposition & flyping

Functions

arc_cut_sets(k, order[, ...])

Computes the arc cut sets for a given planar diagram or oriented planar diagram.

cut_decomposition(k, cut_path[, vertex_maker])

Cuts the diagram into two parts by cutting each arc with an endpoint in the cut path.

cut_nodes(k)

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

find_arc_cut_set(k, order[, ...])

Find one arc cut set of size order in a planar diagram.