Finally,a set of point which is made up of detouring points and pins is formed.By using the points of the set as the vertices ,a weighted complete graph is formed.

• 最后,以绕障点和待布点组成布线点集合,以布线点集合中的所有点为顶点构造带边权值的完全图,将布线问题转化为在带边权值的完全图中求布线点间的最短路径,从而得到最优布线路径。