2015迷宫最短路径问题新算法3).docxVIP

迷宫最短路径问题新算法摘 要: 提出了求解迷宫最短路径问题的新算法, 该算法抛弃了经典算法( 深度优先搜索和广度优先搜索) 中繁杂低效的递归、回溯思想。通过合理的变换, 将原问题转化为迷宫路径深度图的生成问题。最后对算法进行了严谨的分析和实例测试, 显示出该算法易于理解、易于编程、时间空间复杂度低等优点。关键词: 最短路径; 时间复杂度; 深度优先搜索; 广度优先搜索New Algorithm for Solving Shortest Path of Maze ProblemZHANG Lin- feng, LV Hui, QU Jun- feng(The Missile Institute, Air Force Engineering University, Sanyuan, Shannxi 713800, China)Abstract: A new algorithm is presented for solving the shortest path of maze problem, which is not based on the inef-ficient recursive backtracking theory of classical algorithm (DFS- Depth First Search and BFS- Breadth First Search).