在Python中向樹添加子節點

我想在python中創建一棵樹，我希望能夠在之後的寬度上進行首次遍歷。但是，當我嘗試循環節點（即根節點）的子節點時，似乎沒有找到任何子節點。但是，如果我嘗試單獨訪問該子項（root.children [1]），它是有效的。我很確定我在做一些愚蠢的事情，但我不確定在哪裏。這裏是我的代碼：在Python中向樹添加子節點

class Component: 
    def __init__(self, compName, originName, connected = False): #removed to decrease code size 
    def __str__(self): 
     return "\n\tComponent Name: {0}\n\tOrigin Name: {1}\n\tConnected: {2}\n".format(self.name, self.origin, str(self.connected)); 

class Node: 
    def __init__(self, component, parent): 
     self.children = [];  
    def add_node(self, node):  
     self.children.append(node); 
     #...left out some broken code that is commented out...# 
    def __str__(self): 
     return "{0}".format(str(self.component)); 

class Tree: 
    def __init__(self): 
    def add_component(self, component, parent = None): 
     if self.root is None: 
      self.root = Node(component, parent); 
     else: 
      self.root.add_node(Node(component, parent)); 

def breadth_first(node): 
    result = []; 
    queue = []; 
    queue.append(node); 

    while queue: 
     node = queue.pop(0); 
     result.append(node); 
     plog("Adding to result\n"); 
     plog(str(node)); 

     if node in node.children: 
      for child in node.children: 
       if child not in result and child not in queue: 
        queue.append(child); 
     else: 
      plog("NO CHILDREN\n"); // this is being displayed 
    return result; 

def main(ScriptArgument, oDesktop): 
    component = Component("Laminate", "B7_TX"); 
    tree = Tree(); 
    tree.add_component(component); 

    component = Component("B7", "B7_TX"); 
    tree.add_component(component, "Laminate"); 

    result = breadth_first(tree.root); 
    for x in result: 
     plog(str(x) + "\n");

這是我得到的輸出：

Adding to result   # output from breadth-first 

Component Name: Laminate #output from breadth-first 
Origin Name: B7_TX 
Connected: False 
NO CHILDREN    # this is indicating that the child was not added properly, I believe 

Component Name: Laminate # output from the loop in main 
Origin Name: B7_TX 
Connected: False

來源

2015-03-31 user2970916

你爲什麼要檢查父母是否在以下行的孩子列表中？

if node in node.children:

我只想做：

[...] 
while queue: 
    node = queue.pop(0); 
    result.append(node); 
    plog("Adding to result\n"); 
    plog(str(node)); 

    for child in node.children: 
     if child not in result and child not in queue: 
      queue.append(child); 
return result;

來源

2015-03-31 18:59:50

我的「如果」檢查是錯誤的。我正在檢查根目錄（或當前）節點是否在它自己的子目錄中，這是錯誤的。我只是改變這個來檢查是否有任何孩子（如果node.children :)，它的工作。

來源

2015-03-31 18:59:42 user2970916

在Python中向樹添加子節點

回答

相關問題