登录
首页 » Visual C++ » migong

migong

于 2016-05-14 发布 文件大小:2KB
0 138
下载积分: 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 个回复

  • cengcipianli
    按照一定的输入求出二叉树的层次遍历,输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)
    2012-06-08 21:44:41下载
    积分:1
  • Set
    使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)
    2009-11-18 13:29:05下载
    积分:1
  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分:1
  • C++
    说明:  标准答案习题1 1.1 简述C++语言程序的结构特点。 答: (1)C++程序由一个或多个函数组成,其中至少有一个主函数main(),程序从主函数开始执行,由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
    2008-11-25 16:16:27下载
    积分:1
  • ch555555
    C数据结构常用算法程序集5,描述数据结构算法。(C data structures commonly used algorithm suite 5, describe data structure algorithms.)
    2005-05-09 16:17:59下载
    积分:1
  • EightQueen
    经典的 数据结构问题 八皇后问题。问题是在8*8的棋盘上放置棋子,要求每条直线上不能出现两个或以上的棋子。(The classical data structure problem Eight queens problem.Question is placed on the 8* 8 board piece, requirements on each line cannot appear two or more pieces.)
    2016-11-23 10:30:11下载
    积分:1
  • GraphTheory
    讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
    2013-12-04 20:12:39下载
    积分:1
  • LinearList
    单链表程序 可执行单链表的基本功能 创建 删除 查找 存取 等等(Basic functions to create a single linked list program executable single linked list delete find access)
    2012-10-31 17:15:54下载
    积分:1
  • DataStructAndAlgorithm
    数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)
    2009-03-14 17:56:03下载
    积分:1
  • point
    用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
    2012-12-16 13:14:04下载
    积分:1
  • 696516资源总数
  • 106436会员总数
  • 7今日下载