文件名称:算法设计
- 所属分类:
- 其他小程序
- 资源属性:
- [C/C++] [源码]
- 上传时间:
- 2017-07-07
- 文件大小:
- 2kb
- 下载次数:
- 0次
- 提 供 者:
- beaut*****
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
问题描述:以一个m×n的长方形表示迷宫,0和1分别表示迷宫中的通路和障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有通路的结论。
基本要求:首先实现一个以链表作存储结构的栈类型,然后编写一个求解迷宫的非递归程序。求得的通路以三元组(i,j,d)的形式输出,其中:(i,j)指示迷宫中的一个坐标,d表示走到下一坐标的方向。(Problem Descr iption: a m * n rectangle represents the maze, and 0 and 1 indicate maze paths and obstacles, respectively. Design a program, for any set of mazes, to find a passage from the entrance to the exit, or draw no access to the conclusions.
Basic requirements: first of all, to achieve a list of storage structures for the stack type, and then write a solution to the maze of non recursive procedures. The resulting path is output in the form of three tuples (I, J, d), where: (I, J) indicates a coordinate in the maze, and D indicates the direction to the next coordinate.)
基本要求:首先实现一个以链表作存储结构的栈类型,然后编写一个求解迷宫的非递归程序。求得的通路以三元组(i,j,d)的形式输出,其中:(i,j)指示迷宫中的一个坐标,d表示走到下一坐标的方向。(Problem Descr iption: a m * n rectangle represents the maze, and 0 and 1 indicate maze paths and obstacles, respectively. Design a program, for any set of mazes, to find a passage from the entrance to the exit, or draw no access to the conclusions.
Basic requirements: first of all, to achieve a list of storage structures for the stack type, and then write a solution to the maze of non recursive procedures. The resulting path is output in the form of three tuples (I, J, d), where: (I, J) indicates a coordinate in the maze, and D indicates the direction to the next coordinate.)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
迷宫求解非递归.cpp
迷宫求解递归.cpp
迷宫求解递归.cpp