abb6952193
adjacency list model is a very common way of representing a tree structure. In this model each row in a table has a prent ID column that references the primary key of another row in the same table. Because of this the primary key must only be one column and is usually some sort of integer. The row with a parent ID of 0 is the root node and is usually the parent of all other rows. Although, there is no limitation in this module that would stop you from having multiple root nodes. WWW: http://search.cpan.org/dist/DBIx-Class-Tree/
2 lines
153 B
Text
2 lines
153 B
Text
SHA256 (DBIx-Class-Tree-0.03003.tar.gz) = 9f89ae00a201186911a2a7fcfc587d7c05d0945f9216785783d77b8b1561a423
|
|
SIZE (DBIx-Class-Tree-0.03003.tar.gz) = 26348
|