摘要
迷宫问题是典型的问题,求解迷宫问题的已有算法大多利用栈来实现,文章利用广度优先查找的方法来解决迷宫问题,给出了一个具体的迷宫例子,详细分析解决的步骤,介绍算法采用的数据结构,并给出算法的完整代码实现。
Maze problem is a typical problem, and the existed algorithms to solve maze problem are always a stack. This article uses a breadth - first search to solve the maze problem, and gives a concrete example of solving the maze, and analy- zes the steps of sloving problem detailedly. Besides, it introduces data structure which the algorithm uses, and offers algorithm implementations with complete codes.
出处
《江西教育学院学报》
2013年第3期27-29,共3页
Journal of Jiangxi Institute of Education
关键词
迷宫问题
广度优先
数据结构
maze problem
breadth first
data structure
