登录
首页 » Visual C++ » maze

maze

于 2012-09-11 发布 文件大小:186KB
0 103
下载积分: 1 下载次数: 4

代码说明:

  一个苹果走迷宫,支持最短路径寻路。可以使用方向键操作,也可以用户自己添加迷宫格式文件,生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)

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

发表评论

0 个回复

  • red-tree
    红黑树 二叉树 性能比较分析 红黑树 二叉树(Red-black tree binary tree performance analysis,)
    2013-03-22 16:57:32下载
    积分:1
  • FreeTree
    无环连通图G=(V, E)亦称为自由树T,其直径是树中所有顶点之间最短路径的最大值,设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
    2013-10-29 16:31:47下载
    积分:1
  • Czhihen
    关于C语言的一些指针的处理算法,能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)
    2016-06-17 11:29:59下载
    积分:1
  • bintree
    一个关于二叉树应用的小程序,包括二叉树的建立,前中后遍历等操作(a program about bintree structure)
    2009-05-17 16:54:29下载
    积分:1
  • ds3
    单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作: (1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。 (源代码:ds3-1.c) (2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。 (源代码:ds3-2.c) (3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。 (源代码:ds3-3.c) (4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。 (源代码:ds3-4.c) (5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。 (源代码:ds3-5.c) (6)在给定的单链表的第i位上插入值为n的节点。 (源代码:ds3-6.c) (7)在给定单链表的值为m的节点的前面插入一个值为n的节点。 (源代码:ds3-7.c) (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )
    2014-05-11 19:19:41下载
    积分: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
  • SeqQueue
    数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
    2013-06-15 16:27:32下载
    积分:1
  • work1
    讲解了循环单链表的建立,以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)
    2010-10-03 11:00:45下载
    积分:1
  • data-struct
    对于数据结构每一章节的相应的练习题,巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)
    2012-10-09 17:03:41下载
    积分:1
  • 8_queen
    8_queen问题的一个自创的算法,还不错!(8_queen)
    2009-10-21 11:49:24下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载