multiset-comb: Combinatorial algorithms over multisets
Various combinatorial algorithms over multisets, including generating all permutations, partitions, size-2 partitions, size-k subsets, necklaces, and bracelets.
| Versions [faq] | 0.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.4.1 |
|---|---|
| Dependencies | base (>=3 && <5), containers (>=0.5 && <0.7), transformers (>=0.3 && <0.6) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2010 Brent Yorgey |
| Author | Brent Yorgey |
| Maintainer | byorgey@gmail.com |
| Revised | Revision 1 made by BrentYorgey at 2019-01-18T19:53:00Z |
| Category | Math |
| Bug tracker | http://hub.darcs.net/byorgey/multiset-comb/issues |
| Source repo | head: darcs get http://hub.darcs.net/byorgey/multiset-comb |
| Uploaded | by BrentYorgey at 2016-05-09T21:08:26Z |
| Distributions | Debian:0.2.4.1, NixOS:0.2.4.1 |
| Downloads | 6602 total (16 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2016-11-25 [all 1 reports] |
Downloads
- multiset-comb-0.2.4.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'.