Can you explain? I always thought the sql required to add / remove nodes from a nested-set were not trivial In all other ways, llblgen helps me write data-access faster and better, but with hierarchial data it doesn't. Maybe a generic Tree utility class could be added?
Please check this thread:
It should give you some ideas and pointers to how to do it. As you can see, the selects aren't that complex.
The simple way of storing a tree (parent and child in same table with an FK field in the table to its own PK) doesn't allow a hierarchy fetch in 1 go, unless you want to fetch everything. So it's not trivial to solve this as it relies on how the db looks.