Package cc.redberry.combinatorics

Enumerating combinations. Provides algorithms for enumerating (without in memory storing) different types of combinations. List of algorithms: IntPermutations Enumerates all permutations of dimension N (N! permutations). IntCombinations Enumerates all combinations of K elements chosen from N (N!/(K!(N-K)!) combinations). IntCombinationsWithPermutations Enumerates all combinations with permutations of K elements chosen from N (N!/(N-K)! combinations). IntDistinctTuples Enumerates all distinct N-tuples, which can be chosen from N sets of integers. IntTuples Enumerates all N-tuples, which can be chosen from N sets of integers of the form arrayi = [0, 1, 2, ..., Ki]. IntPermutationsWithPriority Enumerates all permutations of dimension N (N! permutations) and allows to affect on the enumeration order. IntCompositions Enumerates all integer compositions.

Since:
1.0