1 package DBIx::Class::Tree;
2 # vim: ts=8:sw=4:sts=4:et
7 use vars qw( $VERSION );
8 use base qw( DBIx::Class );
17 DBIx::Class::Tree - Manipulate and anaylze tree structured data. (EXPERIMENTAL)
21 The tree modules provide the tools to represent, modify, and analyze
22 trees of data with DBIx::Class.
26 L<DBIx::Class::Tree::AdjacencyList> - Manage a tree of data using the
27 common adjacency list model. (EXPERIMENTAL)
29 L<DBIx::Class::Tree::AdjacencyList::Ordered> - Glue DBIx::Class::Ordered
30 and DBIx::Class::Tree::AdjacencyList together. (EXPERIMENTAL)
34 All tree related modules must conform to have and use the basic traversal
35 methods of a DAG. For the most part this just means that Tree modules
36 must provide the appearance of having multiple parents per node (via a
37 parents() method) but may very well never return more than one parent.
38 All utility modules, such as a Visitor module, should do its best to
39 never assume that a node only has one parent. There are situations
40 where this is not possible - in those cases the module's documentation
41 should clearly state that it is not compatible with DAGs.
43 So far there is no Tree::DAG module, but there will be. These requirements
44 are vague, and the requirements of Tree modules to be DAG compatible will
45 become more defined in due course.
49 Aran Clary Deltac <bluefeet@cpan.org>
53 You may distribute this code under the same terms as Perl itself.