This class encapsulates/makes/manipulates objects that represent nodes in a tree structure. The tree structure is not an object itself, but is emergent from the linkages you create between nodes. This class provides the methods for making linkages th...

Tree::DAG_Node::Persist reads/writes multiple trees from/to a single database table, where those trees are built using Tree::DAG_Node. See the "FAQ" for details of the table structure....

This package extends Tree::DAG_Node to add XPath queries to it It adds the findnodes, matches and find methods to the base "Tree::DAG_Node" class. With a little customization it can also add the findnodes_as_string and findvalue methods....

This is meant to be a full-featured N-ary tree representation with configurable error-handling and a simple events system that allows for transparent persistence to a variety of datastores. It is derived from Tree::Simple, but has a simpler interface...

When you've got one of those nasty self-referential tables that you want to bust out into a tree, this is the module to check out. Assuming there are no horribly broken nodes in your tree and (heaven forbid) any circular references, this module will ...

This module implements a memory-efficient node type (for trees, skip lists and similar data structures) for Perl. You may ask "Why bother implementing an ordered structure such as a tree when Perl has hashes built-in?" Since Perl is optimized for spe...

This module in an fully object-oriented implementation of a simple n-ary tree. It is built upon the concept of parent-child relationships, so therefore every Tree::Simple object has both a parent and a set of children (who themselves may have childre...

This module is a fully object oriented implementation of a binary tree. Binary trees are a specialized type of tree which has only two possible branches, a left branch and a right branch. While it is possible to use an *n*-ary tree, like Tree::Simple...

"Tree::Cladogram" provides a mechanism to turn a tree into a cladogram image. The image is generated using Imager or Image::Magic. The image type created is determined by the suffix of the output file. See "What image formats are supported?" for deta...

A Tree::RB tree is made up of nodes that are objects of type Tree::RB::Node...

This module provides an XPath engine, that can be re-used by other module/classes that implement trees. It is designed to be compatible with Class::XPath, ie it passes its tests if you replace Class::XPath by Tree::XPathEngine. This code is a more or...

This serves as an abstract base class to the Tree::Simple::View::* classes. There are two implementing classes included here; Tree::Simple::View::HTML and Tree::Simple::View::DHTML. Other Tree::Simple::View::* classes are also being planned, see the ...

DBIx::Tree::Persist provides sample code for playing with Tree and Tree::Persist a la DBIx::Tree....

NOTE: Versions 0.003 and below used a custom graph management implementation which had various problems with rendering glitches and performance. This version has been rewritten from scratch to use Tree::DAG_Node to handle the tree structure, and as s...

This module implements a binary search tree, which is a specialized usage of a binary tree. The basic principle is that all elements to the left are less than the root, all elements to the right are greater than the root. This reduces the search time...