Polynomial-delay generation of functional digraphs up to isomorphism

02/27/2023

∙

by   Antonio E. Porreca, et al.

∙

0

∙

share

We describe a procedure for the generation of functional digraphs up to isomorphism; these are digraphs with uniform outdegree 1, also called mapping patterns, finite endofunctions, or finite discrete-time dynamical systems. This procedure is based on an algorithm for the generation of connected functional digraphs, which is then generalised to arbitrary ones. Both algorithms have an O(n^3) delay between consecutive outputs. We also provide a proof-of-concept implementation of the algorithms.