-
等值线追踪与绘制(源代码)(1.0).rar
等值线追踪与绘制(源代码)(1.0).rar-contour mapping and tracking (source code) (1.0). Rar
- 2022-07-18 10:55:48下载
- 积分：1
-
仓库源码。自己制作的。希望大家可以来信息指教
仓库源码。自己制作的。希望大家可以来信息指教-Warehouse source. Their own. I hope everyone can come to information index
- 2022-11-04 07:35:03下载
- 积分：1
-
采用EVEN方法实现排列
生成{1，2，3，4,……n}的全排列，每个排列只出现一次...
采用EVEN方法实现排列
生成{1，2，3，4,……n}的全排列，每个排列只出现一次-EVEN method used to generate array (1,2,3,4, ... ... n) of the entire array, each with only one
- 2022-08-22 23:54:17下载
- 积分：1
-
算符优先函数
设计一个给定算符优先分析表，用有向图法构造算符优先函数的算法。...
算符优先函数
设计一个给定算符优先分析表，用有向图法构造算符优先函数的算法。-Operator to design a priority function given priority operator analysis table, and have to graph structure function operator priority algorithms.
- 2022-02-02 22:16:24下载
- 积分：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
-
数据库源代码,用来创建一个数据库,是做一个燃气系统的.
数据库源代码,用来创建一个数据库,是做一个燃气系统的.-Database source code, used to create a database, is a gas system.
- 2022-02-05 20:41:58下载
- 积分：1
-
Description of the problem: Given n
问题描述：
给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。
编程任务
对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.
- 2022-04-30 14:06:05下载
- 积分：1
-
a small embedded database support SQL commands, the use of very simple
一个小型的嵌入式数据库，支持SQL命令，使用非常简单-a small embedded database support SQL commands, the use of very simple
- 2023-05-21 09:00:04下载
- 积分：1
-
数据结构课程设计题，用C++语言实现二叉排序数，并对二叉排序数进行，插入，删除，修改等操作...
数据结构课程设计题，用C++语言实现二叉排序数，并对二叉排序数进行，插入，删除，修改等操作-insert delete change
- 2022-03-20 11:35:58下载
- 积分：1
-
c语言数据结构源代码（全）相当经典
c语言数据结构源代码（全）相当经典-c language data structure source code (all) is a classic
- 2022-12-09 19:05:03下载
- 积分：1
