队列遍历节点
#广度搜索breadth-first search
#队列是先进先出
def bsf(root):
queue = [root]
while len(queue)>0:
cur_node = queue.pop(0)
print(cur_node)
for node in cur_node.outputs():
queue.append(node)
node = hou.selectedNodes()[0]
bsf(node)