迷宫问题演示程序

以一个n*n的方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。迷宫问题要求求出从入口（1，1）到出口（n,n）的所有通路，或得出没有通路的结论。

具体要求是：程序启动后显示一张迷宫图板，用白色的方格表示通路，黑色的方格表示障碍。用户可以通过点击的方式改变迷宫图板上通路，设置新的迷宫状态图，然后可以由用户按“开始执行”按钮，即可在迷宫图板上显示从入口（1，1）到出口（n,n）的所有通路。

-Maze problem demo



With a n* n phalanx, says maze, respectively 0 and 1 the pathways and obstacles said maze. Maze problem requirements give from entry (1, 1) to export (n, n), or all the pathways that no pathways conclusion.



Specific requirement is: after starting the program with a labyrinth board, showed white checked says pathways, black squares says obstacles. The user can change the way by clicking on a maze set new pathways, board, which can then be a state chart maze by users click "start execution button to display on board in the maze from entry (1, 1) to export (n, n) all of the passages.