Combinatorial objects stream generators for Java 8+.

Combinatorial Objects Generators for Java 7+.

PHP - A simple, low-memory footprint function to generate all combinations from a multi-dimensionnal array.

Generate Permutations and Combinations in an efficient way.

Java 8 combinatorics-related streams and other utilities

A modern C++ library for efficiently and easily iterating through common combinatorial objects, such as combinations, permutations, partitions and more.

Tool for Solving Problems in Combinatorics and Computational Mathematics

A simple, low-memory footprint function to generate all string combinations from a series of characters.

Fast cartesian product

Abacus: Advanced combinatorics and algebraic number theory symbolic computation library for Node.js / Browser / XPCOM Javascript, Python, Java

Combinatorics generator for JavaScript and Typescript.

A collection of utility classes for dealing with combinations.

Cartesian product for big inputs

Enumeration of all Permutations (Recursion, Single Swap, and in Lexicographic Order), and Combinations. Enumeration of all Topological Orderings on a Directed Graph. Enumeration of all Paths in a connected Graph. Evaluates Critical Path using PERT Algorithm.

Generate all possible unordered samples of size m, without replacement, from a set of n objects

PYthoN COMBinatorics library

Generate every possible combination of values

🎲 Simple calculator that shows the number of possible combinations of the Rubik's Cube

Make your customized wordlist for penetration testing practice (brute force attack, dictionary attack, etc.)

Makes Combination of Given Vector in C++ With Recursive

A Parameter Sweeping Utility Library

Go lang combination package.

Implementation of O(n) Select Algorithm to find K largest elements and compare it's performance with an Algorithm to find K largest elements using Priority Queue. Implementation of Enumeration algorithms - permutations(), combinations(), heap(), and Knuth's Algorithm L.

bruteforge, a selective data combinator.

Algorithm to find possible sets in the game Set using an iterative implementation of n choose 3 for combinations

Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Implementation of Enumeration of all Paths in a connected Graph, and Enumeration of all permutation with alternate parities.

Angular Library built on the top of the combination generator package of @udjamaflip in order to generate all possible (unique) permutations of a provided list of characters.

Analyze the combine with and without the repetition. (SOON)

Tiny program to display all of the element combinations.

Geco, a (Constant Amortized Time) recursive generator* for k-combinations, chosen from a given set S of n elements.