def get_children(p, s, length):
children = set()
if length < 0:
return children
for subset in permutations(s, length):
setsubset = set(subset)
append = True
for node in children:
if setsubset == node.s:
append = False
break
n = Node(setsubset, p)
n.children = get_children(n, setsubset, length-1)
if append:
children.add(n)
return children
评论列表
文章目录