seeking maze exports from the entrance to the path of all the procedures for a classic design problem. The computer maze room, normally used was "exhaustive solution" approach, that is, from the entrance, with a direction to explore, if we can follow links, will continue to move forward; Otherwise, return along the same route, a direction for the continued exploration and until all possible pathway to date has explored. To ensure that in any position along the same route can return, obviously need a last-in, first-out to preserve the structure from the entrance of the current location of the path. Therefore, in the Palace fans access algorithm application "stack" is naturally a thing of the past.

Packet : 83390059tracy.rar filelist
数据结构课程设计.doc
Debug
main.dsw
main.ncb
main.opt

• 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．