Transposition Cipher Algorithm

Algorithm::SISort is a Perl module that contains select and insert sorting algorithm. SYNOPSIS use Algorithm::SISort qw(Sort Sort_inplace); @sorted_list = Sort {$_[0] <=> $_[1]} @unsorted_list; # ... or ... $number_of_comparisons = Sort_inplace {$_[0] <=> $_[1]} @unsorted_list; This...

Algorithm::Merge is a Perl module package that provides three-way merge and diff. SYNOPSIS use Algorithm::Merge qw(merge diff3 traverse_sequences3); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } }); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } },...

Algorithm::Huffman is a Perl extension that implements the Huffman algorithm. SYNOPSIS use Algorithm::Huffman; my %char_counting = map {$_ => int rand(100)} (a .. z, A .. Z); # or better the real counting for your characters # as the huffman algorithm doesnt work good with random data...


Platforms: *nix

Optimization Algorithm Toolkit is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more. The project...


Platforms: *nix

Algorithm::Networksort can create inline comparisons for sorting. SYNOPSIS use Algorithm::Networksort qw(:all); my $inputs = 4; # # Generate the network (a list of comparators). # my @network = nw_comparators($inputs); # # Print the list, and print the graph of the list. # print...


Platforms: *nix

Algorithm::SocialNetwork is a social network analysis. SYNOPSIS use Graph::Undirected; use Algorithm::SocialNetwork; my $G = Graph::Undirected->new(); $G->add_edges([qw(a b)], [qw(b c)]); my $algo = Algorithm::SocialNetwork->new(graph => $G3); my $BC = $algo->BetweenessCentrality(); #...


Platforms: *nix

Algorithm::Diff is a Perl module to compute `intelligent differences between two files / lists. SYNOPSIS require Algorithm::Diff; # This example produces traditional diff output: my $diff = Algorithm::Diff->new( @seq1, @seq2 ); $diff->Base( 1 ); # Return line numbers, not indices...


Platforms: *nix

Algorithm::SixDegrees is a Perl module that can find a path through linked elements in a set. SYNOPSIS use Algorithm::SixDegrees; my $sd1 = Algorithm::SixDegrees->new(); $sd1->data_source( actors => &starred_in ); $sd1->data_source( movies => &stars_of ); @elems = $sd1->make_link(actors,...


Platforms: *nix

Algorithm::Line::Bresenham is a Perl module that contains a simple pixellated line-drawing algorithm. SYNOPSIS use Algorithm::Line::Bresenham qw/line/; my @points = line(3,3 => 5,0); # returns the list: [3,3], [4,2], [4,1], [5,0] line(3,3 => 5,0, &draw_line); # calls draw_line on each...


Platforms: *nix

Algorithm::C3 is a module for merging hierarchies using the C3 algorithm. SYNOPSIS use Algorithm::C3; # merging a classic diamond # inheritence graph like this: # # # / # # / # my @merged = Algorithm::C3::merge( D, sub { # extract the ISA array # from the package no...


Platforms: *nix

Algorithm::Pair::Best is a Perl module to select pairings (designed for Go tournaments, but can be used for anything, really). SYNOPSIS use Algorithm::Pair::Best; my $pair = Algorithm::Pair::Best->new( ? options ? ); $pair->add( item, ? item, ... ? ); @pairList = $pair->pick( ? $window...


Platforms: *nix

Algorithm::SkipList is a Perl implementation of skip lists. SYNOPSIS my $list = new Algorithm::SkipList(); $list->insert( key1, value ); $list->insert( key2, another value ); $value = $list->find(key2); $list->delete(key1); This is an implementation of skip lists in Perl. Skip...


Platforms: *nix

Algorithm::ScheduledPath is a Perl module that helps you to find scheduled paths in a directed graph. SYNOPSIS use Algorithm::ScheduledPath; use Algorithm::ScheduledPath::Path; $graph = new Algorithm::ScheduledPath(); $graph->add_edge( { path_id => R, origin => A, depart_time => 1,...


Platforms: *nix

Algorithm::Munkres is a Perl extension for Munkres solution to classical Assignment problem for square and rectangular matrices. This module extends the solution of Assignment problem for square matrices to rectangular matrices by padding zeros. Thus a rectangular matrix is converted to square...


Platforms: *nix

Algorithm::LUHN is a Perl module to calculate the modulus 10 double add double checksum. SYNOPSIS use Algorithm::LUHN qw/check_digit is_valid/; $c = check_digit("43881234567"); print "It worksn" if is_valid("43881234567$c"); $c = check_digit("A2C4E6G8"); # this will cause an error...


Platforms: *nix

Algorithm::AhoCorasick::SearchMachine provides an implementation and low-level interface of Algorithm::AhoCorasick. Feeds input to the state machine. First (after the instance) argument of this method is the input text (which can be empty, in which case the method doesnt do anything), second...


Platforms: *nix

Algorithm::AhoCorasick provides efficient search for multiple strings. Aho-Corasick is a classic (1975) algorithm for locating elements of a finite set of strings within an input text. It constructs a finite state machine from a list of keywords, then uses the machine to locate all occurrences...


Platforms: *nix

Algorithm::NeedlemanWunsch is a sequence alignment with configurable scoring. SYNOPSIS use Algorithm::NeedlemanWunsch; sub score_sub { if (!@_) { return -2; # gap penalty } return ($_[0] eq $_[1]) ? 1 : -1; } my $matcher = Algorithm::NeedlemanWunsch->new(&score_sub); my $score =...


Platforms: *nix

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...


Platforms: *nix

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point. Requirements: - MATLAB 7.6 or higher


Platforms: Windows, Mac, *nix, Matlab, BSD Solaris