摘要
迷宫问题是《数据结构》中是作为栈的典型应用举例,且迷宫是以二维数组来存储的,表面上看似乎迷宫问题是一种特殊问题的解决方法,其实迷宫问题是一种特殊形式的图的问题。因此,迷宫问题总是可以转化为图的问题来解决的。讨论如何将迷宫问题转化成图的问题,以及如何利用图的算法来解决迷宫问题。
The problem of maze uses and gives an example as the stack model application in Data Struction, and the maze is stored with two - dimensional array, outwardly it seems that the problem of the maze is a kind of special way to solve the problem, the question of the maze is a question of the graph of a kind of special form in fact. So, the problem of the maze can always be turned into the problem pursued and solved. This text discusses how to transform the question of the maze into a question pursued, and how to utilize the algorithm pursued to solve the problem of the maze.
出处
《湖南人文科技学院学报》
2006年第3期73-75,共3页
Journal of Hunan University of Humanities,Science and Technology
关键词
迷宫问题
图
邻接表
the problem of maze
graph
border on the form
