| 迷宫问题的最短距离标记法递归求解 |
| |
| 引用本文： | 杨元法,庄明. 迷宫问题的最短距离标记法递归求解[J]. 浙江师范大学学报(自然科学版), 2005, 28(1): 37-41 |
| |
| 作者姓名： | 杨元法 庄明 |
| |
| 作者单位： | 1. 浙江师范大学,化学与生命科学学院,浙江,金华,321004
2. 浙江师范大学,信息科学与工程学院,浙江,金华,321004 |
| |
| 摘 要： | 用标记每个搜索位置离起始位置最近距离的方法,通过递归函数求解,提出了一个对复杂迷宫的简明求解算法.求解结果给出了迷宫通道中所有各点离入口的最短距离、次短距离等有意义的批量信息.
|
| 关 键 词： | 复杂迷宫 最短距离 标记距离 递归 |
| 文章编号： | 1001-5051-(2005)01-0037-05 |
| 修稿时间： | 2003-10-27 |
An algorithm for maze by marking shortest path with recursive backtracking |
| |
| YANG Yuan-fa,ZHUANG Ming. An algorithm for maze by marking shortest path with recursive backtracking[J]. Journal of Zhejiang Normal University Natural Sciences, 2005, 28(1): 37-41 |
| |
| Authors: | YANG Yuan-fa ZHUANG Ming |
| |
| Abstract: | An algorithm is presented for complex maze by marking shortest path between the start point and current exploring point with recursive backtracking. The result of solving complex maze contains an intersting information such as the shortest path, the second shortest path between start point and any point on the maze route. |
| |
| Keywords: | complex maze shortest path marking path recursive backtracking |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
