Hi, can i create a DAG- directed acyclic tree (not binary tree but generic)whose elements are instance of specific python class.
Pseudo code:
class x:
def __init__(self,name):
self.name=name
tree= Tree()
g1= tree.add_route(x("g1"))
g2=rt.add_node(x("g2"))
....
some thing like that ..