module for the efficient generation of combinatorial sequences
Algorithm::Combinatorics is an efficient generator of combinatorial sequences. Algorithms are selected from the literature (work in progress). Iterators do not use recursion, nor stacks, and are written in C. See Math::Combinatorics for a pure-Perl module with similar (if less efficient) features.
Debian: Florian Schlichting <email@example.com>
6 March 2014
License: artistic or gpl-1+
Leaders and contributors
Resources and communication
|Debian (Ref) (R)||https://tracker.debian.org/pkg/libalgorithm-combinatorics-perl|
This entry (in part or in whole) was last reviewed on 9 April 2018.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.