littletree 0.2.2

Tree library

LittleTree is a library that provides trees. The package is purely written in python and tries to be easy to use, but operations are generally implemented in an efficient way. It was created because all other tree implementations were either too basic, slow or complicated.

Installing

• Use pip to install littletree:

$ pip install --upgrade littletree

Usage

A tree can be used in a similar way as a dict:

from littletree import Node

tree = Node(identifier="World")
tree["Asia"] = Node()
tree["Africa"] = Node()
tree["America"] = Node()
tree["Europe"] = Node()

print(tree.to_string())
tree.to_image('world.png')  # Works if dot(graphviz) is on path

The resulting tree looks like this:

World
├─ Asia
├─ Africa
├─ America
└─ Europe

See tutorial for more information.

Limitations

• Each node has a single parent
• A node can't have a sibling with the same identifier

Alternatives

Before creating this, I looked at some other libraries. Each had some things I liked and disliked. None of them was exactly how I wanted it, so I decided to create something new.

• anytree - Very hackable, but implementation uses lists, which makes lookups slow.
• bigtree - Similar to anytree, but has more features.
• itertree - Has many features and is fast, but its design is complex.
• treelib - Puts all nodes of a tree into a single flat dict.
• networkx - A tree is a special kind of graph