Tree::Trie - A data structure optimized for prefix lookup. River stage one • 4 direct dependents • 8 total dependents

This module implements a trie data structure. The term "trie" comes from the word retrieval, but is generally pronounced like "try". A trie is a tree structure (or directed acyclic graph), the nodes of which represent letters in a word. For example, ...

AVIF/Tree-Trie-1.9 - 02 Dec 2011 00:54:09 GMT

Tree::SEMETrie - Single-Edge Multi-Edge Trie River stage one • 1 direct dependent • 1 total dependent

MORNINDED/Tree-SEMETrie-0.04 - 14 Dec 2011 22:04:18 GMT

lib/Tree/SEMETrie/Iterator.pm River stage one • 1 direct dependent • 1 total dependent

MORNINDED/Tree-SEMETrie-0.04 - 14 Dec 2011 22:04:18 GMT

Tree::Simple - A simple tree object River stage three • 17 direct dependents • 706 total dependents

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...

RSAVAGE/Tree-Simple-1.33 - 06 Jan 2018 06:10:38 GMT

4 results (0.039 seconds)