将从迷宫入口到各点的最短路近的集合看作一棵树。用广度遍历

的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点

到其余各点最短路近的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.