如何创建家谱？

Question

与家人共享词典我如何创建一棵树？

字典有看起来像这样的结构：

{'parent':'Smith', 'children':[ 
    {'parent':'Connor', 'children':[ 
     {'parent':'Alexis','children':[ 
      {'parent':'Joe', 'children':[ 
       {'parent':'Clark','children':[]}]}]}, 
     {'parent':'Sue','children':[]}]}, 
    {'parent':'Cooper', 'children':[ 
     {'parent':'Max','children':[ 
      {'parent':'Luis', 'children':[]},]}, 
     {'parent':'Elvis', 'children':[]}, 
     {'parent':'Steven', 'children':[]}]}]} 

创建家谱，我怎么能检查一些日期，如后： 如何检查多少成员得到了整个家庭或树的单家独户。

检查整个家族树根或家庭的某个部分有多大。

如何将新成员添加到家庭树内的现有位置或新位置？树

编辑

添加例如：

Smith 
    Conor 
     Alexis 
      Joe 
       Clark 
     Sue 
    Cooper 
     Max 
      Luis 
     Elvis 
     Steven 

相同的样式计算机系统目录下。

Answer 1

这只是inspectorG4dget的答案，几乎在那里，但需要一些改变：

class Person: 
    ID = itertools.count() 
    def __init__(self, name, parent=None, level=0): 
     self.id = self.__class__.ID.next() # next(self.__class__.ID) in python 2.6+ 
     self.parent = parent 
     self.name = name 
     self.level = level 
     self.children = [] 

def createTree(d, parent=None, level=0): 
    if d: 
     member = Person(d['parent'], parent, level) 
     level = level + 1 
     member.children = [createTree(child, member, level) for child in d['children']] 
     return member 

t = createTree(my_tree)   # my_tree is the name of your dictionary 
def printout(parent, indent=0): 
    print '\t'*indent, parent.name 
    for child in parent.children: 
     printout(child, indent+1)   
printout(t) 

根据上面的注释，您需要在程序开始时import itertools。

编辑：扁平化树中的功能应该服务于一切你想做的事：

def flatten(parent): 
    L = [parent] 
    for child in parent.children: 
     L += flatten(child) 
    return L 
flattened_tree = flatten(t) 
print "All members: ", [person.name for person in flattened_tree] 
print "Number of members:", len(flattened_tree) 
print "Number of levels:", max([person.level for person in flattened_tree]) + 1 
cooper = flattened_tree[6] 
cooper_fl = flatten(cooper) 
print "Members below Cooper: ", [person.name for person in cooper_fl] 
print "Number:", len(cooper_fl) 
levels = [person.level for person in cooper_fl] 
print "Number of levels:", max(levels) - min(levels) + 1 

Answer 2

未经检验的，但是这应该这样做

class Person: 
    ID = itertools.count() 
    def __init__(self): 
     self.id = next(self.__class__.ID) 
     self.parent = None 
     self.children = [] 

def createTree(familyTreeDict, parent=None): 
    if not familyTreeDict: 
     return [] 
    else: 
     members = [] 
     for name familyTreeDict: 
      members.append(Person(name)) 
      members[-1].parent = parent 
      for child in familyTreeDict[name]: 
       members[-1].children.append(createTree(child, members[-1])) 
     return members 

然后，如果你想打印出一个树状结构，给出从createTree输出：

def printout(family, indent=0): 
    for parent in family: 
     print '\t'*indent, parent.name 
     for child in parent.children: 
      printout(child, indent+1) 

希望这有助于