@hackage combinatorial0.1

Count, enumerate, rank and unrank combinatorial objects

Categories
- Mathematics
License
BSD-3-Clause
Maintainer
Henning Thielemann <haskell@henning-thielemann.de>
Links
Versions
- 0.1.1 Sun, 4 Feb 2024
- 0.1.0.1 Fri, 31 Aug 2018
- 0.1 Fri, 16 Feb 2018
- 0.0 Fri, 16 Feb 2018

Installation
In your cabal file:
Dependencies (5)
- array >=0.4 && <0.6
- base >=4.5 && <5
- containers >=0.4.2 && <0.6
- transformers >=0.3 && <0.6
- utility-ht >=0.0.8 && <0.1
Dependents (3)
@hackage/board-games, @hackage/battleship-combinatorics, @hackage/sum-pyramid

Counting, enumerating, ranking and unranking of combinatorial objects. Well-known and less well-known basic combinatoric problems and examples.

The functions are not implemented in obviously stupid ways, but they are also not optimized to the maximum extent. The package is plain Haskell 98.

See also:

exact-combinatorics: Efficient computations of large combinatoric numbers.
combinat: Library for a similar purpose with a different structure and selection of problems.