-
ADO database based on the daily sales record of the software, there are printing...
基于ADO数据库的记录日常开销的软件，还有打印功能。-ADO database based on the daily sales record of the software, there are printing function.
- 2022-07-27 05:56:51下载
- 积分：1
-
二叉树排序代码，动态生成二叉树，进行动态查找
二叉树排序代码，动态生成二叉树，进行动态查找-Binary tree sort code, dynamically generated binary tree, dynamic search
- 2022-01-25 16:15:25下载
- 积分：1
-
Hotel management program, mainly for small a la carte restaurant cash register,...
酒店管理程序，主要用于小型饭店点菜收银，功能完备-Hotel management program, mainly for small a la carte restaurant cash register, a fully functioning
- 2022-07-05 03:10:30下载
- 积分：1
-
development with a small database management system DBMS
一个用c开发的小型数据库管理系统dbms-development with a small database management system DBMS
- 2022-07-07 09:42:27下载
- 积分：1
-
内部数据结构课程设计的比较研究，共10…
数据结构课程设计内部排序的比较
一共有十种排序方法-Curriculum design of internal data structure to sort of comparison a total of 10 kinds of sorting methods
- 2023-08-05 04:50:02下载
- 积分：1
-
二叉平衡树算法，包括二叉平衡树的数据结构定义、创建、插入、查找、删除、释放内存等方法。...
二叉平衡树算法，包括二叉平衡树的数据结构定义、创建、插入、查找、删除、释放内存等方法。-two forks balanced tree algorithms, including two forks balance tree data structure definition, create, insert, search, delete, release methods such as memory.
- 2022-05-28 02:14:50下载
- 积分：1
-
界面美观,功能齐全,连接数据库,适合初学者
界面美观,功能齐全,连接数据库,适合初学者-Interface appearance, complete functions, connected databases, suitable for beginners
- 2022-08-24 06:00:51下载
- 积分：1
-
Prim algorithm using minimum spanning tree of the experimental procedures used i...
用prim算法实验最小生成树
本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树
定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。
定义二维数组g[ ][ ]来建立无向图的邻接矩阵。
-Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.
- 2022-03-16 20:21:07下载
- 积分：1
-
iweoq FJ vnxcjoiaeafag dfgadfxae
IWEOQ FJ VNXCJOIAEAFAG DFGADFXAE
- 2022-03-04 19:07:53下载
- 积分：1
-
Realizes the compartment dispatch with the stack form,The train entrance compart...
用栈的形式实现车厢调度,火车入口处的车厢序列编号为1到n-Realizes the compartment dispatch with the stack form,The train entrance compartment sequence serial number is 1 to n
- 2022-05-15 19:35:41下载
- 积分：1
