登录
首页 » Visual C++ » maze

maze

于 2011-03-27 发布 文件大小:1KB
0 220
下载积分: 1 下载次数: 0

代码说明:

说明:  由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)

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

发表评论

0 个回复

  • ANT
    A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)
    2012-05-17 09:14:21下载
    积分:1
  • SHU
    为了点分 求分下载好麻烦 c++二叉排序树(In order to find points dotted download good trouble c++ binary sort tree)
    2013-07-25 01:35:56下载
    积分:1
  • josephus
    说明:  约瑟夫算法,适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)
    2011-04-13 16:43:47下载
    积分:1
  • 2
    说明:  用链表的方式实现多项式的加减,其中结构体包含幂次和系数。(Polynomial addition and subtraction with a list of ways in which the structure and contains the power of coefficients.)
    2017-03-10 09:10:31下载
    积分:1
  • Huffman
    哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)
    2010-06-09 13:09:47下载
    积分:1
  • Subset
    说明:  子集和数问题.rar,用C++写的,可以运行(Subset of several problems. Rar, written in C++, you can run)
    2010-04-16 17:42:12下载
    积分:1
  • AOV-Sort-Algorithm
    使用C语言编写的AOV网的拓扑排序,内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
    2011-10-26 16:34:29下载
    积分:1
  • BinaryTree
    二叉树实现,整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)
    2012-12-28 10:40:23下载
    积分:1
  • Dijkstra
    迪杰斯特拉算法,数据结构,C语言写的,上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)
    2013-03-06 21:50:34下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(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.)
    2013-12-13 17:55:45下载
    积分:1
  • 696518资源总数
  • 106227会员总数
  • 11今日下载