Package cc.redberry.combinatorics
package cc.redberry.combinatorics
Enumerating combinations. Provides algorithms for enumerating (without in memory storing) different types of combinations.
IntPermutationsIntCombinationsIntCombinationsWithPermutationsIntDistinctTuplesN sets of integers. IntTuplesN sets of integers of the form arrayi = [0, 1, 2, ..., Ki]. IntPermutationsWithPriorityIntCompositions- Since:
- 1.0
-
ClassDescriptionCombinatorial iterator.This class provides factory and utility methods for combinatorics infrastructure.Iterator over all unordered combinations (i.e.Iterator over over all possible unique combinations with permutations (i.e.This interface is common for all combinatorial iterators.Iterator over all compositions of specified integer into N parts.Iterator over all distinct N-tuples, which can be chosen from
Nsets of integers.Iterator over all possible permutations.Iterator over all possible permutations of specified that allows to adjust the "niceness" of particular permutations, such they will appear earlier in the iteration if iterator was reset viaIntPermutationsWithPriority.reset().Iterator over all N-tuples (not necessary to be distinct), which can be chosen fromNarrays of integers of the form arrayi = [0, 1, 2, ..., Ki].