Maze problem demo With a n* n phalanx, says maze, respectively 0 and 1 the pathways and obstacles said maze. Maze problem requirements give from entry (1, 1) to export (n, n), or all the pathways that no pathways conclusion. Specific requirement is: after starting the program with a labyrinth board, showed white checked says pathways, black squares says obstacles. The user can change the way by clicking on a maze set new pathways, board, which can then be a state chart maze by users click "start execution button to display on board in the maze from entry (1, 1) to export (n, n) all of the passages.

Labyrinth demo.doc

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