Tree::DAG_Node Tree::DAG_Node is a Perl (super)class for representing nodes in a tree.
Download

Tree::DAG_Node Ranking & Summary

Tree::DAG_Node Tags

Perl module Tree node tree nodes represent nodes DAG

Tree::DAG_Node Description

Tree::DAG_Node is a Perl (super)class for representing nodes in a tree. Tree::DAG_Node is a Perl (super)class for representing nodes in a tree.SYNOPSISUsing as a base class: package Game::Tree::Node; # or whatever you're doing use Tree::DAG_Node; @ISA = qw(Tree::DAG_Node); ...your own methods overriding/extending the methods in Tree::DAG_Node...Using as a class of its own: use Tree::DAG_Node; my $root = Tree::DAG_Node->new(); $root->name("I'm the tops"); my $new_daughter = $root->new_daughter; $new_daughter->name("More"); ...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 that can be used to build up a tree, while preventing you from ever making any kinds of linkages which are not allowed in a tree (such as having a node be its own mother or ancestor, or having a node have two mothers).This is what I mean by a "tree structure", a bit redundantly stated:· A tree is a special case of an acyclic directed graph.· A tree is a network of nodes where there's exactly one root node (i.e., 'the top'), and the only primary relationship between nodes is the mother-daugher relationship.· No node can be its own mother, or its mother's mother, etc.· Each node in the tree has exactly one "parent" (node in the "up" direction) -- except the root, which is parentless.· Each node can have any number (0 to any finite number) of daughter nodes. A given node's daughter nodes constitute an ordered list. (However, you are free to consider this ordering irrelevant. Some applications do need daughters to be ordered, so I chose to consider this the general case.)· A node can appear in only one tree, and only once in that tree. Notably (notable because it doesn't follow from the two above points), a node cannot appear twice in its mother's daughter list.· In other words, there's an idea of up (toward the root) versus down (away from the root), and left (i.e., toward the start (index 0) of a given node's daughter list) versus right (toward the end of a given node's daughter list).Trees as described above have various applications, among them: representing syntactic constituency, in formal linguistics; representing contingencies in a game tree; representing abstract syntax in the parsing of any computer language -- whether in expression trees for programming languages, or constituency in the parse of a markup language document. (Some of these might not use the fact that daughters are ordered.)(Note: B-Trees are a very special case of the above kinds of trees, and are best treated with their own class. Check CPAN for modules encapsulating B-Trees; or if you actually want a database, and for some reason ended up looking here, go look at AnyDBM_File.)Many base classes are not usable except as such -- but Tree::DAG_Node can be used as a normal class. You can go ahead and say: use Tree::DAG_Node; my $root = Tree::DAG_Node->new(); $root->name("I'm the tops"); $new_daughter = Tree::DAG_Node->new(); $new_daughter->name("More"); $root->add_daughter($new_daughter);and so on, constructing and linking objects from Tree::DAG_Node and making useful tree structures out of them. Requirements: · Perl

Tree::DAG_Node Related Software