登录
首页 » Visual C++ » maze

maze

于 2010-09-02 发布 文件大小:854KB
0 258
下载积分: 1 下载次数: 1

代码说明:

  通过学习奥赛培训课程,利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)

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

发表评论

0 个回复

  • LinkNode
    这个是C++编译的单链表,其中包括多种链表操作,是很好的学习资料。(This is a C++ compiler single linked list, which includes a variety of linked list operations, is a good learning materials.)
    2012-09-24 17:22:21下载
    积分:1
  • maze
    通过学习奥赛培训课程,利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)
    2010-09-02 21:43:32下载
    积分:1
  • Euler-algorithm
    这是一个实现找出欧拉路径的的算法,比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)
    2014-07-13 15:20:12下载
    积分:1
  • baiji
    百鸡算法是一种简单的逻辑算法,通过不同的鸡不同的价钱,得出大鸡小鸡的个数(Typical code for white chicken algorithm)
    2012-06-02 16:31:30下载
    积分:1
  • zhebanchazhao
    实现折半查找,非递归形式,从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)
    2012-08-29 12:35:25下载
    积分: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
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • c语言,码图合集
    说明:  a set of uestc computer academic matu
    2020-04-05 20:19:20下载
    积分:1
  • maze
    实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
    2016-05-25 22:56:59下载
    积分:1
  • box-nesting
    最长d维箱嵌套问题的贪心算法, 采用贪心算法不能得到整体最优解, 但其最终结果也可以是最优解的很好的近似(The Greedy Algorithm of the Longest Nesting of d一Dimenson Boxes)
    2012-06-11 16:47:23下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载