文件名称:labyrinth
- 所属分类:
- 汇编语言
- 资源属性:
- [C/C++] [源码]
- 上传时间:
- 2013-01-07
- 文件大小:
- 1kb
- 下载次数:
- 0次
- 提 供 者:
- weiho*****
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
实验实现基本思路:若当前位置可通,则纳入当前路径,并继续朝下一个位置探索,即切换下一位置为当前位置,如此重复直至到达出口;若当前位置不可通,则应顺着来向退回到前一通道块,然后朝着除来向之外的其他方向继续探索;若该通道块的四周4个方块均不可通,则应从当前路径上删除该通道块。设以栈记录当前路径,则栈顶中存放的是当前路径上最后一个通道块。由此,纳入路径的操作即为当前位置入栈;从当前路径上删除前一通道块的才操作即为出栈。-The experimental realization of the basic idea: if the current position can pass into the current path, and continue down a position to explore, to switch to the next position is the current position, so repeat until you reach the exit incommensurability current position, should be down to to return to the previous channel block, and then continue to explore moving in the other direction than to come to the channel around the block four box incommensurability, should be removed from the current path of the channel block. To stack records the current path is stored in the top of the stack is the last channel block in the current path. Thus, included in the path of the operation is the current position of the stack delete the previous channel block from the current path before the operation is the stack.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
labyrinth.cpp