Algorithm::Combinatorics Algorithm::Combinatorics Perl module is an efficient generator of combinatorial sequences.
Download

Algorithm::Combinatorics Ranking & Summary

Algorithm::Combinatorics Tags

Perl module combinatorial sequences combinatorial algorithms combinatorial sequences

Algorithm::Combinatorics Description

Algorithm::Combinatorics Perl module is an efficient generator of combinatorial sequences. Algorithm::Combinatorics Perl module is an efficient generator of combinatorial sequences.SYNOPSIS use Algorithm::Combinatorics qw(permutations); my @data = qw(a b c); # scalar context gives an iterator my $iter = permutations(@data); while (my $p = $iter->next) { # ... } # list context slurps my @all_permutations = permutations(@data);Algorithm::Combinatorics is an efficient generator of combinatorial sequences. Algorithms are selected from the literature (work in progress, see "REFERENCES"). Iterators do not use recursion, nor stacks, and are written in C.Tuples are generated in lexicographic order. Requirements: · Perl

Algorithm::Combinatorics Related Software