摘要
用标记每个搜索位置离起始位置最近距离的方法,通过递归函数求解,提出了一个对复杂迷宫的简明求解算法.求解结果给出了迷宫通道中所有各点离入口的最短距离、次短距离等有意义的批量信息.
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.
出处
《浙江师范大学学报（自然科学版）》
CAS
2005年第1期37-41,共5页
Journal of Zhejiang Normal University:Natural Sciences
