def cut_tree(tree, current_node,cut_num,avoid_num):
    next=current_node.real_best_child()
    if next!=None:
        for node in tree:
            if node !=current_node:
                if node.real_best_child().location==next.location:
                    avoid_num[node.AGV]+=1
                for i in range(len(node.children)):
                    if node.children[i].location==next.location:
                        del node.children[i]
                        cut_num[node.AGV]+=1 #计一次干扰（不一定是避让）
                        break
def sort_tree(tree):
    score_set=[]
    tree_list=[]
    list=[]
    for AGV in tree:
        score_set.append(AGV.real_best_child().quality_value/AGV.real_best_child().visit_times)
    tree_list=sorted(enumerate(score_set),key=lambda  x:x[1])
    list=[x[0] for x in tree_list]
    return list