用队列式分支界限法来求解布线问题.

从起始点a开始将它作为第一个扩展结点，把与该扩展结点相邻的可行的活结点加入到活结点队列，并把这些方格标记为1，表示从起始方格到这些方格的距离为1。接着从活结点队列中取出对列首结点作为下一个扩展结点，并把与当前结点相邻的且未标记的方格标记为2，并存入活结点队列。这个过程一直持续到搜索到目标方格b或活结点队列为空为止-With queue-type branch boundaries method for solving routing problem. From the starting point for a beginning to it as the first expansion of nodes, the node with the expansion of neighboring feasible points slipknot slipknot points added to the queue, and these grid marked as 1, that from the starting grid to these grid distance is 1. Slipknot point from the queue and then retrieve the list of the first node as the next node to expand, and with the current adjacent node and did not mark the box labeled as 2, and deposited slipknot point queue. This process continued until the search to the target grid point b or slipknot until queue is empty