文件名称:migongsuanfa
介绍说明－－下载内容均来自于网络，请自行研究使用
将从迷宫入口到各点的最短路近的集合看作一棵树。用广度遍历
的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点
到其余各点最短路近的Dijkstra算法。-Maze from the entrance point to the most recent collection of short circuit as a tree. Breadth traversal methods used to find the shortest path near exports. Algorithm derived from this procedure thinking that seek to map the remaining points near the Dijkstra shortest path algorithm.
的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点
到其余各点最短路近的Dijkstra算法。-Maze from the entrance point to the most recent collection of short circuit as a tree. Breadth traversal methods used to find the shortest path near exports. Algorithm derived from this procedure thinking that seek to map the remaining points near the Dijkstra shortest path algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
migongsuanfa.doc