ttree
— taxonomy tree
Taxonomy tree implementation.
Tree data structure is an important data structure in computer programming languages. It has wide applications with hierarchical data connections say file systems and some algorithms in Machine Learning. ttree is created to provide an efficient implementation of tree data structure in Python.
The main features of ttree
includes:
- Efficient operation of node indexing with the benefit of dictionary type.
- Support common tree operations like traversing, insertion, deletion, node moving, shallow/deep copying, subtree cutting etc.
- Support user-defined data payload to accelerate your model construction.
- Has pretty tree showing and text/json dump for pretty print and offline analysis.
Quick Start
$ pip install ttree
Documentation
For installation, APIs and examples, see http://ttree.readthedocs.io/en/latest/
Update
- 2017-12-06: Fork
treelib
tottree
package by Vladimir Bolshakov - 2017-08-10: Abandon supporting Python 3.2 since v1.4.0.
- 2012-07-07: First published.
Contributors
-
- Brett Alistair Kromkamp
- Post basic idea online.
-
- Xiaming Chen
- Finished primary parts and made the library freely public.
-
- Holger Bast
- Replaced list with
dict
for fast node index and optimized the performance.
-
- Ilya Kuprik
- Added ZIGZAG tree-walk algorithm to tree traversal.
-
- Vladimir Bolshakov
- Performance improvements, add typings, drop Python 2 support