combinatorial: Count, enumerate, rank and unrank combinatorial objects

[ bsd3, library, math, statistics ] [ Propose Tags ]

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.

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.0, 0.1, 0.1.0.1
Change log Changes.md
Dependencies 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) [details]
License BSD-3-Clause
Author Henning Thielemann <haskell@henning-thielemann.de>
Maintainer Henning Thielemann <haskell@henning-thielemann.de>
Revised Revision 1 made by HenningThielemann at 2018-02-16T08:11:31Z
Category Math, Statistics
Home page http://hub.darcs.net/thielema/combinatorial/
Source repo this: darcs get http://hub.darcs.net/thielema/combinatorial/ --tag 0.0
head: darcs get http://hub.darcs.net/thielema/combinatorial/
Uploaded by HenningThielemann at 2017-12-16T11:33:31Z
Distributions LTSHaskell:0.1.0.1, NixOS:0.1.0.1, Stackage:0.1.0.1
Downloads 2397 total (23 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-12-16 [all 1 reports]