迷宫的问题实质上就是图的遍历问题，我们可以用一个二维数组存储一个迷宫的各个结点，给定一个开始的坐标和一个结束的坐标．本程序可以寻找一条路径，但这条路径不是最短的．就是说不是最优的．-maze is the essence of the plan traverse the problem, we can use a two-dimensional array storage a maze of the various nodes, to set a beginning and an end coordinates of the coordinates. This procedure can find a path, but this is not the shortest path. Not to say the best.