登录
首页 » Visual C++ » maze

maze

于 2013-12-13 发布 文件大小:1081KB
0 238
下载积分: 1 下载次数: 4

代码说明:

  迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分:1
  • 2
    说明:  用数据结构的遍历,对于小毛驴过河解决实际问题。(Traversing the data structure used for the small donkey across the river to solve practical problems.)
    2010-06-02 22:50:30下载
    积分:1
  • migong
    迷宫问题,利用随机数自动生成迷宫,并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )
    2021-04-26 16:48:45下载
    积分:1
  • point
    用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
    2012-12-16 13:14:04下载
    积分:1
  • bintree
    一个关于二叉树应用的小程序,包括二叉树的建立,前中后遍历等操作(a program about bintree structure)
    2009-05-17 16:54:29下载
    积分:1
  • paixu
    实现冒泡,快速,希尔排序法。并计算,比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
    2012-05-21 22:13:12下载
    积分:1
  • ysph
    约瑟夫环,数据结构算法,挺有意思,看看,看看(ysphdfgfgf)
    2009-03-14 00:16:15下载
    积分:1
  • Test6
    最短路径算法。 用无向带全图的邻接矩阵存储图,确定从源点出发到其它各点的最短路径。 输入:图中包含的顶点数n 边数m, 各边权值,用邻接矩阵或者邻接表存储。 输出:源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
    2014-05-11 17:05:37下载
    积分:1
  • sort
    自己编写的几种经典的排序算法,里面有自己做的PPT详细讲解,希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)
    2012-08-28 09:31:28下载
    积分:1
  • Tetris
    使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
    2013-03-27 10:51:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载