-
jsp连接数据库大全，sqlserver数据库，mysql数据库，Oracle数据库，DB2数据库，Informix数据库，Sybase数据库，PostgreS...
jsp连接数据库大全，sqlserver数据库，mysql数据库，Oracle数据库，DB2数据库，Informix数据库，Sybase数据库，PostgreSQL数据库 -jsp connectivity database Guinness！！
- 2023-05-03 11:10:03下载
- 积分：1
-
数据结构课程设计报告1
数据结构课程设计报告1-sergyrt hgrth
- 2023-05-22 19:25:03下载
- 积分：1
-
student select course system,powerbuilder做的，很容易实现 ,不会有人上载了吧...
student select course system,powerbuilder做的，很容易实现 ,不会有人上载了吧-student select course system, powerbuilder done, it is easy to realize that no one on the right is contained
- 2022-02-27 05:46:13下载
- 积分：1
-
Shortest Path 2 is the data structure of knowledge but the procedures are a litt...
最短路径2 是有关数据结构的知识 但是程序稍稍有一个小小的失误-Shortest Path 2 is the data structure of knowledge but the procedures are a little bit errors
- 2023-01-02 17:10:03下载
- 积分：1
-
VB系软件开发者不可多得的开发伴侣
VB系软件开发者不可多得的开发伴侣-- VB software developers rare development partners
- 2023-03-20 01:25:04下载
- 积分：1
-
如果要连接的数据库文件和当前文件在同一个目录下
如果要连接的数据库文件和当前文件在同一个目录下-If you want to connect to the database file and the current document in the same directory
- 2022-04-19 00:08:28下载
- 积分：1
-
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
迷宫算法（maze）
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
*/
-/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
- 2022-08-08 06:28:42下载
- 积分：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
-
The use of ADO technology to connect ACCESS database (change the connection stri...
运用ADO技术连接ACCESS数据库（改变连接字串就能连接SQL数据库），做了一个家庭记账管理软件！用到了读写数据，写数据，更改数据，删除数据等操作，学习数据库编程的朋友可以看看！-The use of ADO technology to connect ACCESS database (change the connection string will be able to connect SQL database), so a family of account management software! Use the read and write data, write data, change data, delete data operation, the study database programming friends can see!
- 2022-05-06 02:48:08下载
- 积分：1
-
matlab 三种聚类算法合集（机器学习）
机器学习的基础在于分类与聚类，此处分享三种聚类算法，matlab平台
- 2023-02-25 06:15:03下载
- 积分：1
