-
visual c++用于数据库编程的源程序
visual c++用于数据库编程的源程序-visual c++ for database programming source code
- 2022-03-06 15:20:56下载
- 积分：1
-
数据结构
数据结构
数据结构
数据结构
数据结构
数据结构
数据结构
数据结构
-data structure data structure data structure data structure data structure data structure data structure data structure data structure
- 2023-02-03 21:55:03下载
- 积分：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
-
回溯法的模板，关键是回溯的过程，以及在深搜过程中的方向问题...
回溯法的模板，关键是回溯的过程，以及在深搜过程中的方向问题-Backtracking template, the key is back process, as well as in the course of the deep question of the direction search
- 2022-06-15 15:31:48下载
- 积分：1
-
Oracle training in 18 days the teacher
Oracle培训18天老师的笔记，对学习oracle数据库有非常大的帮助-Oracle training in 18 days the teacher
- 2023-01-22 08:25:04下载
- 积分：1
-
实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。...
实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。-Implement a database connection pool to improve the efficiency of the database links, while also help balance the amount of physical access.
- 2023-04-24 23:15:04下载
- 积分：1
-
数据结构 内部排序PPT 希尔排序 快速排序 归并排序
数据结构 内部排序PPT 希尔排序 快速排序 归并排序-Internal data structure to sort PPT
- 2022-06-19 08:18:08下载
- 积分：1
-
一个很叨 的算法作业,很强大的源代码
很强大的源代码很强大的源代码...
一个很叨 的算法作业,很强大的源代码
很强大的源代码很强大的源代码-A very garrulous operation of the algorithm, it is a powerful source code is a powerful source code is a powerful source code
- 2022-05-09 13:29:44下载
- 积分：1
-
哈夫曼树和哈夫曼编码：
从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编...
哈夫曼树和哈夫曼编码：
从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。
设计要求：
⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例
⑵ 在程序中构造四个子程序为
① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/
② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/
③ void printhtree(HTree *t, int* path) /*中序打印树*/
④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/
-Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri
- 2022-01-22 06:46:42下载
- 积分：1
-
利用Excel进行读写操作，很方便，很实用，可以试一试
利用Excel进行读写操作，很方便，很实用，可以试一试-Use Excel to read and write operation, it is convenient and very practical, you can try
- 2022-01-26 17:16:57下载
- 积分：1
