With an m × n the long square maze, 0 and 1, respectively maze of pathways and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or come to the conclusion there is no path. First of a two-dimensional array to store the data maze, maze data input by the user. A linked list storage structure for stack type, and then write a recursive or non-recursive solving the maze procedure. Obtained access to triples (i, j, d) in the form of output, of which: (i, j) indicates the maze of a coordinate, d represents the coordinates walked next direction (east, south, west, north four directions used on behalf of a digital, self-defined)

Maze code.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．