Introduction - If you have any usage issues, please Google them yourself
Design algorithm to generate a NM (N rows and M columns) of the maze, the maze to complete the organization and storage. Achieve two different maze routing algorithms: breadth-first and depth-first algorithm, and compare (including theoretical and experimental) time complexity of the two methods.