-
suoxiangshi jiajiancheng
多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂-suoxiangshi jiajiancheng
- 2022-01-27 15:17:49下载
- 积分：1
-
此程序是利用图形函数画Lagranges函数，分段插值函数，Hermite函数的函数图形...
此程序是利用图形函数画Lagranges函数，分段插值函数，Hermite函数的函数图形-This program is the use of graphics functions draw Lagranges function, sub-interpolation function, Hermite function is a function of graphical
- 2022-02-14 08:52:56下载
- 积分：1
-
全国交通算法,求最短路径,最省时间,最少工作量.
VC开发的,很有借鉴意义...
全国交通算法,求最短路径,最省时间,最少工作量.
VC开发的,很有借鉴意义-National transport algorithm for the shortest path, least time, at least workload. VC developed referential significance
- 2022-05-15 10:30:14下载
- 积分：1
-
表达式求值：支持浮点运算，以及一些纠错功能
表达式求值：支持浮点运算，以及一些纠错功能-expression evaluates : support floating-point operations, and some correction function
- 2022-05-28 13:31:42下载
- 积分：1
-
设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试...
设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing
- 2022-09-01 23:30:03下载
- 积分：1
-
此篇代码的功能是关于K路文件的归并，用于数据结构，算法等设计...
此篇代码的功能是关于K路文件的归并，用于数据结构，算法等设计-Cipian functionality of the code files on K road merging, for data structures, algorithm design
- 2022-05-23 05:28:30下载
- 积分：1
-
这是数据结构课程设计的4个原程序代码分别是数据结构课程设计――猴子选大王问题数据结构课程设计...
这是数据结构课程设计的4个原程序代码分别是数据结构课程设计――猴子选大王问题数据结构课程设计-This the data structure of curriculum design four original code was designed data structure courses-- monkeys elected king issues of curriculum design data structure
- 2022-11-05 08:40:03下载
- 积分：1
-
ADO 封装好的数据库操作类 ，直接可以使用标准接口
ADO 封装好的数据库操作类 ，直接可以使用标准接口-ADO packaged good category database operations directly can use the standard interface
- 2022-04-25 16:28:45下载
- 积分：1
-
用VC6.0写的库存数据库项目的整体管理
用vc6.0写的全面管理库存的数据库程序-Vc6.0 write with the overall management of inventory database program
- 2022-03-07 17:55:31下载
- 积分：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
