-
数据结构中经典的约瑟夫环问题的解法。
数据结构中经典的约瑟夫环问题的解法。-data structure classic Josephus the solution.
- 2022-03-10 18:20:08下载
- 积分：1
-
使用ADO访问经过加密的ACCESS数据库，用VC编写。
使用ADO访问经过加密的ACCESS数据库，用VC编写。-Use ADO component to interview database of ACCESS,using VC programming
- 2022-02-02 02:41:01下载
- 积分：1
-
sqlite读写VC例子,很不错，值得收藏研究！
sqlite读写VC例子,很不错，值得收藏研究！-sqlite read VC example, it is good, worthy of study collections!
- 2022-09-09 01:55:03下载
- 积分：1
-
Because time is so short, relatively simple function. Interested persons can con...
由于时间仓促，所以功能比较简单。有兴趣者可以继续扩展这个系统！-Because time is so short, relatively simple function. Interested persons can continue to expand this system!
- 2022-06-03 08:37:28下载
- 积分：1
-
单源点最短路径算法
* 本程序用来实现单源点最短路径（E.Dijkstra）算法
* 在Turbo C2.0编译器下编译通过
* 算法过程中...
单源点最短路径算法
* 本程序用来实现单源点最短路径（E.Dijkstra）算法
* 在Turbo C2.0编译器下编译通过
* 算法过程中
* 每条边的两个顶点和权值由用户输入，格式：1 2 20
* 程序默认源点为第一个顶点
* 算法完成后输出路径长度和路径上的顶点
* 格式为：路径长度：目标顶点
- 2022-03-23 04:50:33下载
- 积分：1
-
数据结构课程的电子教案，很好，很精彩，为初学者的好帮手。
数据结构课程的电子教案，很好，很精彩，为初学者的好帮手。-Electronic data structure course lesson plans, very good, very exciting, a good helper for beginners.
- 2023-07-20 17:00:04下载
- 积分：1
-
数据结构
详细描述了如何创建二叉树的方法以及操作
数据结构
详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of
- 2022-02-01 06:31:34下载
- 积分：1
-
用module来定义数据类型
用module来定义数据类型-module used to define data types
- 2022-10-07 09:40:03下载
- 积分：1
-
发货查询系统作业，delphi 写的,演示 数据库德操作和 打印输出...
发货查询系统作业，delphi 写的,演示 数据库德操作和 打印输出-this is a test for delphi and access
- 2022-06-20 04:00:49下载
- 积分：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
