Description: 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
To Search:
File list (Check if you may need any files):
布线问题\Position.java
........\WireRouter.java
布线问题
Download