结合无网格布线的特点 ,提出一种新的无网格拆线重布算法 .该算法显式地表示并动态更新线网所属区域的拥挤程度 .在拆线重布进行待布线网的路径搜索时 ,每个扩展节点中增加拆除线网周边的拥挤权重 ,从而将待布线网的路径搜索过程和拆除线网的选择过程统一起来 ,有效地提高了被拆除线网重新布通的可能性 .该算法利用改进的二叉区间树有效组织中间数据 ,降低计算的复杂度 .实验结果表明 ,该算法能有效消除布线顺序对布线结果的影响 ,提高布通率 ,且算法运行速度较快 Combined with the characteristics of meshless routing, a new meshless rewinding algorithm is proposed, which explicitly expresses and dynamically updates the degree of congestion in the area to which the wireline belongs. During the search, the crowding weight around the network is added to each extended node, so that the process of searching for the route to be routed and the process of selecting the network to be removed are unified, which effectively increases the possibility of re-routing of the network to be demolished The algorithm uses the improved binary interval tree to effectively organize the intermediate data to reduce the computational complexity.The experimental results show that the algorithm can effectively eliminate the influence of the routing order on the routing results and improve the patch rate and the algorithm runs faster