tree

Bio::Tree::Tree is an implementation of TreeI interface.

SYNOPSIS

# like from a TreeIO
my $treeio = new Bio::TreeIO(-format => newick, -file => treefile.dnd);
my $tree = $treeio->next_tree;
my @nodes = $tree->get_nodes;
my $root = $tree->get_root_node;

This object holds handles to Nodes which make up a tree.

Creata-Tree will create one of the most powerful JavaScript menu trees available for your website.

Its free and comes complete with installation and un-installation. The program has a nice tree view for you to layout items and its very straightforward. Creata-Tree requires only basic HTML skills.

The dynamic tree works in browsers Internet Explorer 4+ and Netscape 4+. All other browsers view a nice static layout of the tree. Why JavaScript? By using JavaScript and keeping the code as open source, developers can manipulate the tree as they wish (see tree code for copyright info).

All objects and functions are accessible through other code on your web site, giving developers the ability to dynamically alter the trees properties from any page on their site. Why not Java? Java Applets can be clunky and slow loading on older systems.

Given all the customization and ability in Creata-Tree, as a Java Applet, it would be VERY slow. Why NeoText? We work hard to bring you the MOST customizable Tree on the net. Many companies and code can compare to one style of tree, with minimal ability. However our tree can do it all, from Explorer trees to Macintosh trees. If it has been done, Creata-Tree can do it. Creata-Tree can even do simple menus with out a tree design.

Cypres Tree is an animated icon that will let you watch waves crashing and birds flying around the Cypres Tree Rock in Monteray, CA.

Tree.app is a blinking Christmas tree for your desktop.
Its the perfect way to remind yourself that the winter holidays are comming.

B-Tree is an educational tool for showing the operations of a B-Tree. More specifically, it graphically demonstrates the B-Tree node layout, key value searching, node deletions, node additions, and splay balancing.

It also provides a description of the processes.

B::Tree is a simplified version of B::Graph for demonstration.

SYNOPSIS

perl -MO=Tree program | dot -Tps > tree.ps

This is a very cut-down version of B::Graph; it generates minimalist tree graphs of the op tree of a Perl program, merely connecting the op nodes and labelling each node with the type of op.

It was written as an example of how to write compiler modules for "Professional Perl", but Ive found it extremely useful for creating simple op tree graphs for use in presentations on Perl internals.

It requires the CPAN GraphViz module and the GraphViz package from http://www.research.att.com/sw/tools/graphviz/. It takes no options.

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 string:
my $string = "THERES MORE THAN ONE WAY TO DO IT"; # TMTOWTDI
my $i = 0;
$tree->insert($_, $i++) foreach (split //, $string);

# find the index of the first T
my $t = $tree->find(T);

# find the indexes of every T
my @t = $tree->find(T);

# We dont like the word WAY , so lets remove it
my $i = index $string, W;
$tree->delete($_, $i++) foreach (split //, substr($string, $i, 4));

# Reverse the sort order
$tree->reverse;

# Iterate through each key/value pair just like built-in each operator
while (my ($key, $value) = $tree->each) {
print "$key => $valuen";
}

# Reset the iterator when we quit from an "each-loop" early
$tree->reset;

# You might also be interested in using multiple each loops at once, which is
# possible through the cursor syntax. You can even delete individual pairs
# from the list during iteration.
my $cursor = $tree->new_cursor;
while (my ($key, $value) = $cursor->each) {
my $nested = $tree->new_cursor;
while (my ($nkey, $nvalue) = $nested->each) {
if ($key->shouldnt_be_in_this_tree_with($nkey)) {
$nested->delete;
}
}
}

# Iterate using an iterator subroutine
$tree->iterate(sub { print "$_[0] => $_[1]n" });

# Iterate using an iterator subroutine that returns the list of return values
# returned by the iterator
print join(, , $tree->map(sub { "$_[0] => $_[1]" })),"n";

# Grep-like operations
my @pairs = $tree->grep (sub { $_[0] =~ /S/ });
my @keys = $tree->grep_keys (sub { $_[0] =~ /S/ });
my @values = $tree->grep_values (sub { $_[0] =~ /S/ });

# Get all keys, values
my @all_keys = $tree->keys;
my @all_values = $tree->values;

# Clear it out and start over
$tree->clear;

B+ trees are balanced trees which provide an ordered map from keys to values. They are useful for indexing large bodies of data. They are similar to 2-3-4 Trees and Red-Black Trees. This implementation supports B+ trees using an arbitrary n value.

POV Tree description
POV-Tree is a Java tree generator for POV-Ray POV-Tree is a Java tree generator for POV-Ray that uses a tree generation algorithm which is used in this program was based on the TOMTREE macro.

You can think of this program as of GUI for that macro. In addition to the possibility to define numerous parameters you can also preview tree and save it either as an include file or as a mesh file.

Think about units used in POV-Tree as centimetres (no support for inches yet :) So trunk radius 20 would mean radius 20 centimetres. Branch start at 300 would mean that branches start at height 3 meters.

The TREE object which you will get either from TOMTREE or as a mesh from POV-Tree is normalized so it occupies 1 unit box in POV-Ray. You have to scale it for your needs.

Produces one of the most powerful JavaScript menu trees available for your web site. Its FREE and comes complete with installation and un-installation. The program has a nice tree view for you to layout items and its very straightforward. Creata-Tree requires only basic HTML skills. The dynamictree works in browsers Internet Explorer 4+ and Netscape 4+. All other browsers view a nice static layout of the tree.

B plus Tree description
A type of tree, which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records B+ Tree was designed to be a type of tree, that represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key.

It is a dynamic, multilevel index, with maximum and minimum bounds on the number of keys in each index segment (usually called a block or node). In a B+ tree, in contrast to a B-tree, all records are stored at the lowest level of the tree; only keys are stored in interior blocks.

Xmass Tree - Animated Screensaver by EleFun Multimedia. Do you enjoy your desktop having beautiful screensaver? Just have a look at Animated Screensaver Xmass Tree . A magnificent Christmas tree stands in the yard of the house decorated with holiday lights. Don t you think that Christmas is an amazing and unique holiday, which cannot be compared to any other holiday of the year? Everything related to Christmas decoration of houses, beautiful fir tree sparkling with its holiday decorations and a garland, all these and many other things evoke the brightest and the most pleasant feelings in us. Install Animated Screensaver Xmass Tree on your computer and let everything rejoice you on this bright Christmas holiday.

This program shows ping times and trace route of internet sites in tree format making it easy to see what the major gateways/routers your internet traffic goes though.