treelib

treelib copied to clipboard

* Having legacy ordering in the current form makes it impossible to print a tree without any ordering at all * Legacy ordering is invoked whenever ``key=None``, so it renders...

christian-krieg

[Survey] Enable node-wide ranking in tree.show()

2

This is a proposed feature by Fahri Basegmez. I want to know if any others require this feature. I have a better implementation of a node ordering based on `data`...

caesar0301

Cannot understand how to use 'successors'

1

Hi! Could you please give me an example of how to get the successors of a node 'a'? I'm not understanding what's the tree_id that is required to use this...

sblbl

could we have this function

john012343210

_[t.add_node(T.Node(identifier=r(), data=1), parent=t.all_nodes()[-1]) for i in range(1,10)]_ ``` > t.show() > 0 > └── 100 > ├── 4 > └── 20 > ├── 28 > ├── 77 > ├── 80...

Veek

Changed from `.../treelib/pull/` to `.../treelib/pulls`. Also added query tag for closed PR's on the Closed PR's badge.

vonNiklasson

Resolve #170 with `show(sorting=False)` to display the tree while maintaining insertion order. Signed-off-by: Hollow Man

HollowMan6

filter, key, reverse, sorting To give users more flexibility. Signed-off-by: Hollow Man

HollowMan6

kaushikcfd

From the code, it looks like the predecessor node function should be able to return None. But in the current implementation, it can't. https://github.com/caesar0301/treelib/blob/2d874516d986a937420215f58143e51d3f0893b5/treelib/node.py#L133

andrewshvv