leafs = tree.leaf_nodes() print "num tips", len(leafs) print "num internal", len(tree.internal_nodes()) print "computed internal", internal_counter print "edge set",len(tree.get_edge_set()) print tree.seed_node.parent_node exit() print "--- iteration ---" # Node traversal msg = "Num children:" for node in tree.preorder_node_iter(): msg += str(len(node.child_nodes())) + " " #msg = "--"+str(node) #first_node = node #if (node.parent_node is None): # msg = msg+"--ROOT--" #if (node.taxon is not None): # msg = msg + str(node.taxon) #if (node.edge is not None): # #msg = msg + "NO EDGE!!!!" # msg = msg + "--edge:"+str(node.edge) #if node.is_leaf(): # msg = msg + " LEAF" #msg = msg+" level : " + str(node.level()) #print msg