combo, a C++ 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.
change_making, a C++ code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
FLOYD, a C++ code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.
KNAPSACK_01, a C++ code which uses brute force to solve small versions of the 0/1 knapsack problem;
LEGENDRE_PRODUCT_POLYNOMIAL, a C++ code which defines Legendre product polynomials, creating a multivariate polynomial as the product of univariate Legendre polynomials.
MONOMIAL, a C++ 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 C++ code which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
POLYNOMIAL, a C++ code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of M dimensions.
SUBSET, a C++ code which generates, ranks and unranks various combinatorial objects.
SUBSET_SUM, a C++ code which seeks solutions of the subset sum problem.
TOMS515, a C++ code which can select subsets of size K from a set of size N. This is a version of ACM TOMS Algorithm 515, by Bill Buckles, Matthew Lybanon.
UNICYCLE, a C++ code which considers permutations containing a single cycle, sometimes called cyclic permutations.