-
With the prim algorithm is seeking to use adjacency matrix storage structure, s...
用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树-With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
- 2022-02-09 15:56:42下载
- 积分：1
-
suoxiangshi jiajiancheng
多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂-suoxiangshi jiajiancheng
- 2022-01-27 15:17:49下载
- 积分：1
-
Ip地址库 Ip地址库
Ip地址库 Ip地址库 -ip address
- 2022-03-06 18:33:41下载
- 积分：1
-
汇编语言好的程序，大家来看看 图书选购,(可按分类方式查找图书，或通过关键字进行查询) 购物车功能. 查看图书详细情况。用户注册. 用户登录. 查看用户的订单信...
汇编语言好的程序，大家来看看 图书选购,(可按分类方式查找图书，或通过关键字进行查询) 购物车功能. 查看图书详细情况。用户注册. 用户登录. 查看用户的订单信息. 修改用户个人信息。后台管理部份：商店图书管理：添加，修改，删除，查看。用户信息管理：查看，修改，删除。订单信息管理：查看订单清单，更新订单付款，出货状态。删除订单。 -good assembly language procedures, to look at the books you buy, (classification according to find books, or through keyword inquiries) Cart function. View details of the books. Registered users. User login. View customer orders information. Revised personal information. Some management background : stores library management : add, modify, delete, check. Users Information Management : View, modify, delete. Orders for information management : View a list of orders, updating of payment orders, shipping status. Delete orders.
- 2022-04-06 23:31:01下载
- 积分：1
-
a series of the ODBC database procedures.
一个自己编的ODBC数据库的程序。-a series of the ODBC database procedures.
- 2022-05-28 19:26:56下载
- 积分：1
-
是数据结构书上的算法，都是比较经典的实现。
是数据结构书上的算法，都是比较经典的实现。-data structure is the book algorithm, which is a more classic realized.
- 2022-12-05 09:50:03下载
- 积分：1
-
This is a test report to verify and insert a delete query to achieve ordered ope...
这是一份实验报告，用以验证和实现插入删除查询排列等数据库语言操作。-This is a test report to verify and insert a delete query to achieve ordered operations such as database language.
- 2022-07-16 11:09:14下载
- 积分：1
-
Order to map any of the distance between two nodes, (2) with two
求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵
(3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。
(4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同
(5) 显示结果要清晰易懂
(6) 本题运行结果
-Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q
- 2022-04-20 12:55:19下载
- 积分：1
-
ACM,竞赛题目,我已经在上面测试过了,可以用,题目是ARGUS,希望大家可以喜欢,花了长时间才弄好的...
ACM,竞赛题目,我已经在上面测试过了,可以用,题目是ARGUS,希望大家可以喜欢,花了长时间才弄好的-ACM, the title race, I have tested in the above, you can use the title ARGUS, hope everyone can like it, spent a long time before the promotion of
- 2023-04-26 08:15:04下载
- 积分：1
-
swgl商务管理系统
swgl商务管理系统-swgl Business Management System
- 2023-03-19 03:35:04下载
- 积分：1
