I'm pleased to announce the first release of PyTrie, a pure Python implementation of the trie (prefix tree) data structure [1].
Tries extend the mapping interface with methods that facilitate finding the keys/values/items for a given prefix, and vice versa, finding the prefixes (or just the longest one) of a given key K. Project links: - PyPI entry: http://pypi.python.org/pypi/PyTrie - Documentation: http://packages.python.org/PyTrie - Repository: http://bitbucket.org/gsakkis/pytrie Regards, George [1] http://en.wikipedia.org/wiki/Trie -- http://mail.python.org/mailman/listinfo/python-list
