Tree Algorithm

This script is a simple example demonstrating the construction of binary trees. Platforms: Windows, Mac, *nix, Python, BSD Solaris

This script implements the Union Find data structure and algorithm. This data structure allows one to find out which set an object belongs to, as well as join two sets. The algorithm's performance, given m union/find operations of any ordering, on n elements has been shown to take log* time per... Platforms: Windows, Mac, *nix, Python, BSD Solaris

Itzam/Java project is a pure Java reimplementation of the Itzam embedded database engine, and it is 100% interoperable with files created by Itzam/Core. Since Itzam/Core is the basis of wrappers written in languages such as C++ and Python, Itzam/Java is compatible with those language libraries... Platforms: *nix

BNet is an exact Bayesian inference library for C++. This library implements the junction tree algorithm for discrete variable Bayesian networks. Examples are provided to illustrate its capabilities. Installation: type make to compile everything type make doc to compile the documentation... Platforms: *nix

The archive includes genfis4.m that generates Mamdani- and Sugeno-type FIS using CART algorithm to extract fuzzy rule information from data set. It is based mostly on Fuzzy Logic Toolbox but it has required to modify Toolbox's fuzzy rule building principle. As a result some original m-files was... Platforms: Matlab

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

Tree::Binary::Search is a binary search tree for Perl. SYNOPSIS use Tree::Binary::Search; my $btree = Tree::Binary::Search->new(); $btree->useNumericComparison(); $btree->insert(5 => "Five"); $btree->insert(2 => "Two"); $btree->insert(1 => "One"); $btree->insert(3 => "Three");... Platforms: *nix

We use the idea of Chu-Liu/Edmonds Algorithm, see paper [1,2], to implement four functions here.1. Maximal Directed Maximum Spanning Tree By DirectedMaximumSpanningTree.m2. Minimal Directed Maximum Spanning Tree By DirectedMinimalSpanningTree.m3. Maximal Directed Maximum Spanning Forest By... Platforms: Matlab

Legacy Family Tree is an award winning full-featured professional genealogy program that helps you track, organize, print, and share your family history. The program is free and has no restrictions. (A Deluxe Edition is also available.) The user interface is easy-to-use and is always... Platforms: Windows

Imagine beautiful quiet lake among the green mountains. The very old oak tree grows on the small island at the midst of the water. This is the Magic Tree. Only one night of the year the strange appealing halo surrounds it, emitting colourful sparkles. This night Magic Tree grants the wishes of... Platforms: Windows

Creata-Tree creates one of the most powerful JavaScript menu trees available for your web site. It comes complete with installation and un-installation. The program has a nice tree view for you to layout items and it's very straightforward. Creata-Tree requires only basic HTML skills. The... Platforms: Windows

Bio::Tree::NodeNHX is a Simple Tree Node with support for NHX tags. SYNOPSIS use Bio::Tree::NodeNHX; my $nodeA = new Bio::Tree::NodeNHX(); my $nodeL = new Bio::Tree::NodeNHX(); my $nodeR = new Bio::Tree::NodeNHX(); my $node = new Bio::Tree::NodeNHX(); $node->add_Descendents($nodeL);... Platforms: *nix

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

Tree::BPTree is a Perl implementation of B+ trees. SYNOPSIS use Tree::BPTree; # These arguments are actually the defaults my $tree = new Tree::BPTree( -n => 3, -unique => 0, -keycmp => sub { $_[0] cmp $_[1] }, -valuecmp => sub { $_[0] <=> $_[1] }, ); # index the entries in this... 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

Bio::Tree::Compatible is a Perl module for testing compatibility of phylogenetic trees with nested taxa. SYNOPSIS use Bio::Tree::Compatible; use Bio::TreeIO; my $input = new Bio::TreeIO(-format => newick, -file => input.tre); my $t1 = $input->next_tree; my $t2 = $input->next_tree; my... Platforms: *nix