-
访问数据的COM组件，主要在VC中使用
访问数据的COM组件，主要在VC中使用-visit data COM, mainly in the use of VC
- 2022-05-08 01:40:25下载
- 积分：1
-
操作系统银行家算法的仿真实现生成可视化文件,便于理解程序
操作系统银行家算法的仿真实现生成可视化文件,便于理解程序-OS bankers realize the simulation algorithm to generate visual documentation, easy to understand procedures
- 2022-03-04 00:09:47下载
- 积分：1
-
几个常见的算法,为c语言编写，在VC6.0环境下编写。
几个常见的算法,为c语言编写，在VC6.0环境下编写。-Several common algorithms, for the c language, in the preparation of VC6.0 environment.
- 2022-02-05 14:07:13下载
- 积分：1
-
节点不需要在链栈、1类铅，和定义…
不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In addition to construction and destructor function, the members also function stack, stack up and stack elements for judging whether non-empty stack, The first document as "nohead_LinStack.h."
- 2022-07-27 00:21:48下载
- 积分：1
-
个人通讯录信息管理系统
个人通讯录信息管理系统 -personal address book information management systems for personal address book information management system
- 2022-03-18 04:45:32下载
- 积分：1
-
数据结构最小生成树
数据结构最小生成树-minimum spanning tree data structure
- 2023-09-05 01:40:04下载
- 积分：1
-
很好的算法，龙贝格积分算法，大家可以下载
很不错的算法，龙贝格积分算法，大家可以下载-Very good algorithm, Romberg Integration Algorithm, everyone can download
- 2022-03-24 12:26:54下载
- 积分：1
-
各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序...
各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序-various commonly used algorithm source, including rapid sequencing/merge sorting/ranking with the deadline and the greedy method to achieve procedures
- 2022-12-08 12:20:03下载
- 积分：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
-
倒下的马棋盘问题的数据结构
数据结构中的马塌棋盘问题-data structure of the fallen horse chessboard problems
- 2022-03-12 21:48:49下载
- 积分：1
