-
迷宫问题 数据结构
迷宫问题 数据结构-maze data structure problem
- 2022-03-14 12:54:31下载
- 积分：1
-
用vb6.0实现GIS的重要算法TIN的生长算法。
用vb6.0实现GIS的重要算法TIN的生长算法。-GIS using vb6.0 an important method to achieve the growth of TIN algorithms.
- 2022-12-21 20:10:03下载
- 积分：1
-
c++&&qt 学生信息管理系统
学生信息管理系统，使用C++和QT语言编写而成，其中使用到数据库操作，本程序仅能在qt5以上版本运行。其中的编码需要转换。文件中还包括本人的实习论文一份！
- 2022-09-17 00:40:03下载
- 积分：1
-
一个用vc实现的Kruskal算法，程序流程非常清晰，有助于对算法的理解。...
一个用vc实现的Kruskal算法，程序流程非常清晰，有助于对算法的理解。-a vc achieved using Kruskal algorithm, program flow is very clear, contribute to the understanding of the algorithm.
- 2022-01-29 01:16:47下载
- 积分：1
-
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
迷宫算法（maze）
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
*/
-/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
- 2022-08-08 06:28:42下载
- 积分：1
-
1・能够创建链表，只须输入数据便能自动生成升序排列的单链表；
2・能够把已存在的两个自动升序的链表合并成一个链表，并保留其中的相同元素；
3・...
1・能够创建链表，只须输入数据便能自动生成升序排列的单链表；
2・能够把已存在的两个自动升序的链表合并成一个链表，并保留其中的相同元素；
3・有友好的人机卷面；-To create one list, only the input data can be automatically generated single-linked list in ascending order 2 can has been in existence for two automatic ascending the list into a list, and retains the same elements 3 have卷面friendly
- 2022-03-19 06:12:31下载
- 积分：1
-
代码注重B树插入、删除的算法逻辑，适用于
学习者研究B树实现的核心思想。代码中无庞杂的无关操作...
代码注重B树插入、删除的算法逻辑，适用于
学习者研究B树实现的核心思想。代码中无庞杂的无关操作-focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation
- 2022-06-02 08:09:41下载
- 积分：1
-
后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度...
后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C* O (n) the complexity
- 2023-07-09 09:35:03下载
- 积分：1
-
vb a source excel treatment program, it is worth U.S. reference learning
vb处理excel的一个源码程序，值得大家参考学习-vb a source excel treatment program, it is worth U.S. reference learning
- 2022-01-25 13:54:44下载
- 积分：1
-
Beijing Bus Inquiry System Beijing Bus Inquiry System
北京公交车查询系统
北京公交车查询系统-Beijing Bus Inquiry System Beijing Bus Inquiry System
- 2022-02-03 12:07:35下载
- 积分：1
