-
labyrinth: You need to find the doable way to go to the
destinaton.And then prin...
labyrinth: you need to find the doable way to go to the destinaton.And then print out the path.-labyrinth: You need to find the doable way to go to the
destinaton.And then print out the path.
- 2023-04-17 06:20:02下载
- 积分:1
-
算法是一种字符串匹配算法!源代码介绍…
bm算法是串的一种匹配算法!本源代码介绍了bm算法的c实现。-bm algorithm is a string matching algorithm! Source code introduced bm Algorithm c achieve.
- 2023-05-22 10:20:03下载
- 积分:1
-
对数据模板窗体的制作与应用说明。by the DbNavigation Database record Add, Delete and so on...
对数据模板窗体的制作与应用说明。by the DbNavigation Database record Add, Delete and so on-template forms of data production and application notes. By the record DbNavigation Database Add, Delete and so on
- 2022-03-03 20:50:21下载
- 积分:1
-
完整的数据库课程设计,含报告,你只需下载就能解决课程设计的问题...
完整的数据库课程设计,含报告,你只需下载就能解决课程设计的问题-Integrity of the database curriculum design, including the report, you can download curriculum design will be able to solve the problem of
- 2022-08-15 15:44:49下载
- 积分:1
-
对二叉树进行插入,打印屏幕等操作
对二叉树进行插入,打印屏幕等操作。使用动态结构实现,可以学习。代码简洁明了,便与学习。有注释。插入元素,采用递归实现。在t节点插入元素x;深度是temp;num表示若是在满二叉树情况下的编号,用于计算坐标;计算深度是x,满二叉树编号是y点的坐标。
- 2023-08-12 22:50:03下载
- 积分:1
-
vb done, good interesting.
vb做的,好有意思,-vb done, good interesting.
- 2022-01-30 14:37:46下载
- 积分:1
-
ODBC数据源注册小工具,简化数据库连接
ODBC数据源注册小工具,简化数据库连接-ODBC data source registered a small tool to simplify database connection
- 2022-09-17 12:20:03下载
- 积分:1
-
严蔚敏老师的数据结构专贴。考研的朋友要好好看哦 是内部资料啊...
严蔚敏老师的数据结构专贴。考研的朋友要好好看哦 是内部资料啊-Yan Wei Min teacher posted a data structure. Graduates to make good friends FACT internal information ah
- 2022-01-28 07:26:06下载
- 积分:1
-
算法设计的分支限界法中的单源最短路径问题的实现,是用VC++编写的...
算法设计的分支限界法中的单源最短路径问题的实现,是用VC++编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared
- 2022-07-27 08:04:35下载
- 积分:1
-
清华大学类数据结构实现的乙
清华大学数据结构课上实现的B+树,设计一个4阶B+树,包括: (1) 叶子的每个记录应该包括4字节(long)关键码值和60字节的数据字段(存储文件名等,可以自定),设每个叶子可以存储5条记录,而内部节点应该是关键码值/指针对。此外,每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等; (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索; (3) 显示(打印)此4阶B+树的生长(含删除节点)过程实例;-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
- 2022-01-21 19:44:41下载
- 积分:1