python-trie

Pure Python implementation of the trie data structure (Python 2)

Description

A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.

This is the Python 2 package.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot

Hint: upload an image here from your clipboard with Ctrl-V


Homepage

http://pythonhosted.org/PyTrie/


Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking on…

Install python-trie

Cookies help us deliver our services. By using our services, you agree to our use of cookies. Learn more