Package org.ddogleg.combinatorics
-
Class Summary Class Description Combinations<T> Computes the combinations of size k given a set S of size N.Permute<T> Exhaustively computes all the permutations of a set, without recursion.
| Class | Description |
|---|---|
| Combinations<T> |
Computes the combinations of size k given a set S of size N.
|
| Permute<T> |
Exhaustively computes all the permutations of a set, without recursion.
|