Efficient generation of combinatorial sequences
Algorithm::Combinatorics is an efficient generator of combinatorial sequences. Algorithms are selected from the literature. Iterators do not use recursion, nor stacks, and are written in C.
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 0.27-36.fc43 | - |
| Fedora 43 | 0.27-36.fc43 | - |
| Fedora 42 | 0.27-34.fc42 | - |
| Fedora 41 | 0.27-33.fc41 | - |
| Fedora EPEL 9 | 0.27-23.el9 | - |
| Fedora EPEL 8 | 0.27-17.el8 | - |
| Fedora EPEL 10.2 | 0.27-33.el10_0 | - |
| Fedora EPEL 10.1 | 0.27-33.el10_0 | - |
| Fedora EPEL 10.0 | 0.27-33.el10_0 | - |
You can contact the maintainers of this package via email at
perl-Algorithm-Combinatorics dash maintainers at fedoraproject dot org.