combinatorial: Count, enumerate, rank and unrank combinatorial objects

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.

Modules

[Index] [Quick Jump]

Downloads

• combinatorial-0.1.1.tar.gz [browse] (Cabal source package)
• Package description (revised from the package)

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

Package maintainers

• HenningThielemann

For package maintainers and hackage trustees

• edit package information

Candidates

• 0.0, 0.1, 0.1.0.1