Top 20 NuGet combinatorics Packages

A combinatorics library providing combinations, permutations & variations. This nuget package wraps up Adrian Akison's original implementation. See: http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G
Define, Combine, Visualize and Replay hundreds of test cases with a few lines of code! Website and source code: http://github.com/jeromerg/NCase NCase is a mix between a Mocking Framework like Moq and a parametrized test framework, having advanced combinatorial capabilities. NCase is not rel...
KaosCombinatorics is a .NET library that provides classes for generating combinations, k-combinations, multicombinations, k-multicombinations, permutations, k-permutations, and products that are ordered and ranked. These sequences of integers may be used to permute (rearrange) other lists of objects...
JS Combinatorics (js-combinatorics) binding library for Bridge.NET projects.
Use NCase in combination with NUnit to write your parametrized tests. This adapter library contains the Nunit specific `ActAndAssert` extension method. Website and source code: http://github.com/jeromerg/NCase NCase allows to define, combine, visualize and replay hundreds of test cases with a ...
Use NCase in combination with Xunit to write your parametrized tests. This adapter library contains the Nunit specific `ActAndAssert` extension method. Website and source code: http://github.com/jeromerg/NCase NCase allows to define, combine, visualize and replay hundreds of test cases with a ...
Various C# Utility classes, that were initially developed for the NCase project.
MathExtensions is a library for .NET that aims to provide useful extensions methods regarding various mathematical domains, like combinatorics, sequence analysis, sequence generation, sequence manipulation, random extractions, etc.
Package Description
Choose and Permute extension methods for IEnumerable<T>
Provides a set of helpful Combinatoric assets for use during operation.
C#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. Algorithms used include shortest augmenting path search and cost-scaling pseudoflow based assignment.
Provides a set of helpful Combinatoric Permutations assets for use during operation.
Provides a set of helpful Combinatoric Permutations assets for use during operation.
Provides a set of helpful Combinatoric assets for use during operation.