登录
首页 » Visual C++ » migong

migong

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

代码说明:

  输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)

文件列表:

数据结构 迷宫.txt,4372,2016-05-05

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

发表评论

0 个回复

  • dijkstra
    dijkstra算法,用于寻找已建立图的最短路径,是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
    2007-07-15 14:14:48下载
    积分:1
  • yuesefu
    约瑟夫问题,通过C语言对约瑟夫问题进行了分析和讲解,从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)
    2011-10-26 10:56:33下载
    积分:1
  • POJ2371
    PKU ONLINEJUDGE 2371
    2011-10-21 15:03:03下载
    积分:1
  • shizuo
    用哈夫曼编码的方式进行图像的压缩,其中定义了一个cdib的类,通过之类来对图像进行处理(image coding in haffman)
    2012-04-27 18:37:47下载
    积分:1
  • list-and-array
    数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
    2013-10-17 11:32:30下载
    积分:1
  • SortDemo
    实现排序操作SortDemoSortDemo.rar,很不错的vc源码,希望对大家有所帮助。(To achieve the sorting operation SortDemo SortDemo.rar, very good vc source, we want to help.)
    2011-09-21 22:16:39下载
    积分:1
  • 14160_1239592890aB1K
    纯C语言写的小型通用数据库,一个C数据结构组科技小组的作品,附有开发思路PPT,这可是一个宝贵的资源哦,更底层的东西,运行于DOS提示符,可以新建数据库等操作。C的编程高手们值得参考一下。 (Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)
    2009-04-13 12:50:21下载
    积分:1
  • HeterogeneityLink(VS2010-CPP)
    VS2010开发 C++语言 实现异质链表(The VS2010 development C++ language heterogeneity linked list)
    2012-12-14 23:41:30下载
    积分:1
  • 48qqqq
    主要用栈和树求解骑士问题,用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
    2009-03-21 22:34:39下载
    积分:1
  • heapsort
    说明:  从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
    2008-11-11 22:53:42下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载