split-decomposition

Verification code for 'Enumeration and Asymptotic Analysis of Strict Non-Plane Cactus Graphs over a Finite Set of Cycle Lengths' - extends the companion single-length paper to a finite mixed set Ω. Includes an exact grammar solver, a high-precision critical-point solver, a Table 1 reproduction script, and a 14-test regression suite.

Exploratory numerical extension of strict m-gonal cactus graph enumeration to mixed cycle-length sets (Ω = {5, 6}), via split-decomposition.