登录
首页 » Visual C++ » maze

maze

于 2016-05-25 发布 文件大小:2KB
0 157
下载积分: 1 下载次数: 1

代码说明:

  实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)

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

发表评论

0 个回复

  • migong
    迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
    2011-06-11 17:13:39下载
    积分:1
  • elevator
    电梯模拟,实现一个模拟电梯的环境,用C程序实现的,封装良好(elevator modify)
    2021-04-22 15:38:48下载
    积分:1
  • PrintTheSchedule_DataStructure_Lab4
    数据结构试验-打印输出计算机本科专业4年每学期的课表;C++实现;图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of ​ ​ the adjacency table storage structure and topological sorting)
    2012-11-24 23:30:41下载
    积分:1
  • BinaryTree
    数据结构二叉树,及其遍历,镜像,输出等相关操作C++源码。(Binary tree data structure and its traversal, mirror, output the operation C++ source.)
    2012-09-01 11:25:15下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • Phone-book
    数据结构课程设计 -电话本(运用了MFC图形化界面)(Curriculum design- the phone book)
    2015-03-09 22:04:07下载
    积分:1
  • 8sort_method
    随机函数产生10000个随机数,用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序,并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义,系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
    2013-02-27 17:27:04下载
    积分:1
  • template
    说明:  ACM及各类基本算法模板,包括数据结构,计算几何,字符串,图论,数学,高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)
    2009-08-20 22:37:29下载
    积分:1
  • 5-source--code-of-DS--PRO
    数据结构课上老师布置的5个小项目的源代码,分别是汽车过河,一元多项式,迷宫,日历,BFS_DFS(failed to translate)
    2011-05-18 17:01:17下载
    积分:1
  • mathandos
    算法设计的动态规划,贪心算法 操作系统的银行家算法等五个小程序(data)
    2009-12-27 17:06:43下载
    积分:1
  • 696518资源总数
  • 105554会员总数
  • 2今日下载