Debian Codegraph @

README

raw
1 NAME
2 DBIx::Class::Tree - Manipulate and anaylze tree structured data.
3
4 GETTING HELP/SUPPORT
5 The community can be found via:
6
7 * IRC: irc.perl.org#dbix-class
8
9 * Mailing list: <http://lists.scsys.co.uk/mailman/listinfo/dbix-class>
10
11 * RT Bug Tracker:
12 <https://rt.cpan.org/Dist/Display.html?Queue=DBIx-Class-Tree>
13
14 * gitweb:
15 <http://git.shadowcat.co.uk/gitweb/gitweb.cgi?p=dbsrgits/DBIx-Class-
16 Tree.git>
17
18 * git: <git://git.shadowcat.co.uk/dbsrgits/DBIx-Class-Tree.git>
19
20 DESCRIPTION
21 The tree modules provide the tools to represent, modify, and analyze
22 trees of data with DBIx::Class.
23
24 COMPONENTS
25 DBIx::Class::Tree::AdjacencyList - Manage a tree of data using the
26 common adjacency list model.
27
28 DBIx::Class::Tree::AdjacencyList::Ordered - Glue DBIx::Class::Ordered
29 and DBIx::Class::Tree::AdjacencyList together.
30
31 DAG
32 All tree related modules must conform to have and use the basic
33 traversal methods of a DAG. For the most part this just means that Tree
34 modules must provide the appearance of having multiple parents per node
35 (via a parents() method) but may very well never return more than one
36 parent. All utility modules, such as a Visitor module, should do its
37 best to never assume that a node only has one parent. There are
38 situations where this is not possible - in those cases the module's
39 documentation should clearly state that it is not compatible with DAGs.
40
41 So far there is no Tree::DAG module, but there will be. These
42 requirements are vague, and the requirements of Tree modules to be DAG
43 compatible will become more defined in due course.
44
45 AUTHOR
46 Aran Clary Deltac <[email protected]>
47
48 LICENSE
49 You may distribute this code under the same terms as Perl itself.
50