combo, a Python code which includes routines for ranking, unranking, enumerating and randomly selecting balanced sequences, cycles, graphs, Gray codes, subsets, partitions, permutations, restricted growth functions, Pruefer codes and trees.
Routines are available to count, list, rank and unrank such objects
Some of these sets of objects can be ordered in several different ways, and in some cases, a separate set of ranking, unranking, and successor routines are available for the various orderings (lexical, colexical, revolving door, Trotter-Johnson).
Kreher and Stinson provide C source-code for the routines, as well as other information, at their web site.
The computer code and data files described and made available on this web page are distributed under the MIT license
combo is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
monomial, a Python code which enumerates, lists, ranks, unranks and randomizes multivariate monomials in a space of m dimensions, with total degree less than n, equal to n, or lying within a given range.
partition_problem, a Python code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
polynomial, a Python code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of m dimensions.
subset, a Python code which generates, ranks and unranks various combinatorial objects.
subset_sum, a Python code which seeks solutions of the subset sum problem.
unicycle, a Python code which considers permutations containing a single cycle, sometimes called cyclic permutations.