迷宫最短路径问题新算法

New Algorithm for Solving Shortest Path of Maze Problem

提出了求解迷宫最短路径问题的新算法,该算法抛弃了经典算法(深度优先搜索和广度优先搜索)中繁杂低效的递归、回溯思想。通过合理的变换,将原问题转化为迷宫路径深度图的生成问题。最后对算法进行了严谨的分析和实例测试,显示出该算法易于理解、易于编程、时间空间复杂度低等优点。

A new algorithm is presented for solving the shortest path of maze problem,which is not based on the inefficient recursive backtracking theory of classical algorithm （DFS-Depth First Search and BFS-Breadth First Search）.By appropriate conversion,the algorithm changes the original problem into the creation of the maze graph problem.At last, an example is given,which shows that the new algorithm is easy to be understood and programmed as well as its low time and space complexity.