Search results
70 packages found
Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements, with and without replacement.
- geco
- combinations
- combinations with repetition
- k-combinations
- multiset
- compositions
- compositions with restricted parts
- colex
- colexicographic order
- CAT
- combinatorics
- generators
- poker
Simple implementation of basic algorithms.
- algorithm
- simulated annealing
- backtracking
- graph
- spanning tree
- shortest path
- combinations
- permutations
- secant method
- bisection method
solve for palindromes within any word, get all combinations too
Streams all the variations (with repetitions) of a set
Streams all the possible combinations of subsets of the set given in input
Generate combinations of array elements
Library to enumerate all natural number lists with a target sum.
Generate random topic combinations from hierarchical concept maps.
Node-red permutations of an array as repeat or messages.
Calculate the number of possible permutations.
Module that generates the unique combinations of key values by taking a single value from each keys array
Iterator generator for getting ordered combinations of items
Implementing of discrete vectors
Generates all the permutations of sentences from words in a 2D array.
Show all variants of a component in a grid
n choose k for js
Set n-combinations for JavaScript
Set n-multicombinations for JavaScript
- combinations
- combinatorics
- k-combination
- multicombinations
- multisubset
- n-multicombinations
- repetitions
- set
- with