TOMS515\
K subsets of an N set {#toms515-k-subsets-of-an-n-set align=”center”}
=====================
TOMS515 is a C++ library which lists the subsets of size K selected
from a set of size N.
Languages: {#languages align=”center”}
TOMS515 is available in a C
version and a C++
version and a FORTRAN77
version and a FORTRAN90
version and a MATLAB
version and a Python
version.
SUBSET, a C++ library which
enumerates combinations, partitions, subsets, index sets, and other
combinatorial objects.
Reference: {#reference align=”center”}
- Bill Buckles, Matthew Lybanon,\
Algorithm 515: Generation of a Vector from the Lexicographical
Index,\
ACM Transactions on Mathematical Software,\
Volume 3, Number 2, June 1977, pages 180-182.
Source Code: {#source-code align=”center”}
Examples and Tests: {#examples-and-tests align=”center”}
List of Routines: {#list-of-routines align=”center”}
- BINOM computes the binomial coefficient.
- COMB selects a subset of order P from a set of order N.
- I4_CHOOSE_CHECK reports whether the binomial coefficient can
be computed.
- I4_UNIFORM_AB returns a scaled pseudorandom I4 between A
and B.
- R8_GAMMA_LOG evaluates the logarithm of the gamma function.
- TIMESTAMP prints the current YMDHMS date as a time stamp.
You can go up one level to the C++ source codes.
Last revised on 01 April 2016.