本源码通过C# GDI+ 编写。提供三种生成迷宫的算法（深度优先法，递归分割法，随机PRIM法），提供基于广度优先算法的迷宫自动寻径算法。迷宫大小、单元格大小、线粗均可自定义。优化了算法，递归改为栈实现，能够生成任意大地图而不会引起原来的函数递归栈溢出问题。生成迷宫后，支持键盘按键进行手动走迷宫。(The source code is written by C# GDI+. Three algorithms of maze generation (depth first, recursion segmentation, random PRIM) are provided to provide a maze routing algorithm based on the breadth first algorithm. Maze size, cell size, line thickness can be customized. The algorithm is optimized and recursive to stack implementation. It can generate any large map without causing the recursive stack overflow problem of the original function. After creating the maze, support the keyboard button to manually walk the maze.)