python遍历结构_在python中循环遍历树形结构？

最新推荐文章于 2023-07-17 23:26:42 发布

weixin_39914863

最新推荐文章于 2023-07-17 23:26:42 发布

阅读量494

点赞数

文章标签： python遍历结构

您可以使用recursion或者您可以使用iteration。无论哪种方式都没有关系。但是你需要一个搜索树的策略。

这里有一些strategry要经过的曲线图：

的主要思想是向不通过相同的节点/叶两次，这是微不足道的用于去树木，但需要coloring为图：

您可以使用一些设计模式，例如， visitor模式，并且您将方法.visit()添加到您的TreeHierarchyClass以访问其子节点，而另一个按名称查找节点。

例如：

# imagine we got this class

class TreeHierarchyClass(object):

def __init__(self, value):

self.children = []

self.value = value

if self.value == 13:

self.name = 'the lucky one.'

def add(self, value):

self.children.append(type(self)(value))

，您可以访问所有的节点：

def visit(tree):

visited = set()

nonvisited = set()

nonvisited.update(tree.children)

while nonvisited:

item = nonvisited.pop()

# already seen

if item in visited:

continue

# mark item

visited.add(item)

yield item

# add children

nonvisited.update(item.children)

让我们构建一个样本树结构：

root = TreeHierarchyClass(0)

for i in range(10):

root.add(i)

for i in range(10):

root.children[1].add(i + 10)

现在让我们找到了一些物品：

def find(name):

for item in visit(root):

print 'checking item with value %d' % item.value,

if getattr(item, 'name', None) == name:

print '- found it.'

break

else:

print '- nope, keep searching.'

else:

print 'Sorry, not found.'

find('the lucky one.')

find('the lost one.')

这个例子会打印：

>>> find('the lucky one.')

checking item with value 7 - nope, keep searching.

checking item with value 0 - nope, keep searching.

checking item with value 1 - nope, keep searching.

checking item with value 12 - nope, keep searching.

checking item with value 2 - nope, keep searching.

checking item with value 9 - nope, keep searching.

checking item with value 19 - nope, keep searching.

checking item with value 3 - nope, keep searching.

checking item with value 11 - nope, keep searching.

checking item with value 4 - nope, keep searching.

checking item with value 14 - nope, keep searching.

checking item with value 5 - nope, keep searching.

checking item with value 6 - nope, keep searching.

checking item with value 15 - nope, keep searching.

checking item with value 8 - nope, keep searching.

checking item with value 16 - nope, keep searching.

checking item with value 13 - found it.

>>> find('the lost one.')