Implement a storage structure in order to queue type, and then write a non-recursive program to solve the maze, get access to a triple (I, j, pre) in the form of output, including: (I, j) indicates a labyrinth of coordinates, the pre said in a square in the queue in this path upper subscript,

CodePudding user response:

Maze do not use a stack, also useless queue wrote a labyrinth, CSDN BBS newbie guide

CodePudding user response:

, of course, you can use the queue!

CodePudding user response:

I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10581430.html
I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10768339.html