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

Packet : 75448144wirerouter.rar filelist
实验3\WireRouter.c
实验3\Queue.h
实验3\WireRouter.dsp
实验3\WireRouter.ncb
实验3\WireRouter.plg
实验3\WireRouter.opt
实验3\WireRouter.dsw
实验3\Debug
实验3

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．