python创建树_python – 从SQLalchemy中的自引用表创建树

看看http://sqlamp.angri.ru/index.html

UPD：对于adjacency_list.py声明示例

from sqlalchemy.ext.declarative import declarative_base

Base = declarative_base(metadata=metadata)

class TreeNode(Base):

__tablename__ = 'tree'

id = Column(Integer, primary_key=True)

parent_id = Column(Integer, ForeignKey('tree.id'))

name = Column(String(50), nullable=False)

children = relationship('TreeNode',

# cascade deletions

cascade="all",

# many to one + adjacency list - remote_side

# is required to reference the 'remote'

# column in the join condition.

backref=backref("parent", remote_side='TreeNode.id'),

# children will be represented as a dictionary

# on the "name" attribute.

collection_class=attribute_mapped_collection('name'),

)

def __init__(self, name, parent=None):

self.name = name

self.parent = parent

def append(self, nodename):

self.children[nodename] = TreeNode(nodename, parent=self)

def __repr__(self):

return "TreeNode(name=%r, id=%r, parent_id=%r)" % (

self.name,

self.id,

self.parent_id

)

修复递归

def get_tree(base_page, dest_dict):

dest_dict = { 'title': base_page.title, 'content': base_page.content }

children = base_page.children

if children:

dest_dict['children'] = {}

for child in children:

get_tree(child, dest_dict)

else:

return

使用查询在示例中从db的递归获取数据：

# 4 level deep

node = session.query(TreeNode).\n options(joinedload_all("children", "children",

"children", "children")).\n filter(TreeNode.name=="rootnode").\n first()