Euclidean Algorithm Gcf

Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd =...

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

Math::Numbers is a Perl module that contains methods for mathematical approaches of concepts of the number theory. SYNOPSIS use Math::Numbers; my $a = 123; my $b = 34; my $numbers = Math::Numbers->new($a, $b [, ...]); print "They are coprimes (relatively primes)!n" if...


Platforms: *nix

Algorithm::TravelingSalesman::BitonicTour is a Perl module to solve the euclidean traveling-salesman problem with bitonic tours. SYNOPSIS use Algorithm::TravelingSalesman::BitonicTour; my $bt = Algorithm::TravelingSalesman::BitonicTour->new; $bt->add_point($x1,$y1); $bt->add_point($x2,$y2);...


Platforms: *nix

QT clustering algorithm as described in:Heyer, L. J., Kruglyak, S., Yooseph, S. (1999). Exploring expression data: Identification and analysis of coexpressed genes. Genome Research 9,...


Platforms: Matlab

Algorithm::Dependency is a base class for implementing various dependency trees. SYNOPSIS use Algorithm::Dependency; use Algorithm::Dependency::Source::File; # Load the data from a simple text file my $data_source = Algorithm::Dependency::Source::File->new( foo.txt ); # Create the...


Platforms: *nix

Algorithm::Knapsack is a brute-force algorithm for the knapsack problem. SYNOPSIS use Algorithm::Knapsack; my $knapsack = Algorithm::Knapsack->new( capacity => $capacity, weights => @weights, ); $knapsack->compute(); foreach my $solution ($knapsack->solutions()) { foreach my $index...


Platforms: *nix

Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old (<=0.59) interface. NOTE This has been provided as part of the Algorithm::Diff package by Ned Konz. This particular module is ONLY for people who HAVE to have the old interface,...


Platforms: *nix

Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. SYNOPSYS use Algorithm::Loops qw( Filter MapCar MapCarU MapCarE MapCarMin NextPermute NextPermuteNum NestedLoops ); my @copy= Filter {tr/A-Z.,"()/a-z/d} @list; my $string= Filter...


Platforms: *nix

Algorithm::Diff::Apply is a Perl module to apply one or more Algorithm::Diff diffs. SYNOPSIS ## Single-diff form: use Algorithm::Diff::Apply qw{apply_diff}; my @ary = ...; my @diff = ...; # some call to Algorithm::Diff::diff() my @changed_ary = apply_diff(@ary, @diff); my $changed_ary =...


Platforms: *nix

Parallel Genetic Algorithm Library (or PGAL for short) is a C++ toolkit for simply, efficiently, and swiftly producing genetic algorithm code that works across multiple processors. This is useful not only for those with multi-processor computers, but also for distributed and cluster computing...


Platforms: *nix

Algorithm::BinPack is a Perl module that can efficiently pack items into bins. SYNOPSIS Algorithm::BinPack efficiently packs items into bins. The bins are given a maximum size, and items are packed in with as little empty space as possible. An example use would be backing up files to CD,...


Platforms: *nix

Genetic Algorithm File Fitter, or just GAFFitter, is a command-line software written in C++ that arranges--via a genetic algorithm--an input list of items or files/directories into volumes of a certain capacity (target), such as CD or DVD, in a way that the total wastage is minimized. By smartly...


Platforms: *nix

Algorithm::Permute is a Perl module with handy and fast permutation with object oriented interface. SYNOPSIS use Algorithm::Permute; my $p = new Algorithm::Permute([a..d]); while (@res = $p->next) { print join(", ", @res), "n"; } my @array = (1..9); Algorithm::Permute::permute { print...


Platforms: *nix

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


Platforms: *nix

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 { } },...


Platforms: *nix

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