-
Thalmann algorithm to achieve the java. Notes detail.
Thalmann算法的java实现。有详细注释。-Thalmann algorithm to achieve the java. Notes detail.
- 2022-03-18 02:57:27下载
- 积分：1
-
data structure Learning Guide "book on the source
数据结构导学》书上的源程序-data structure Learning Guide "book on the source
- 2022-07-17 05:16:34下载
- 积分：1
-
用VB+access数据库设计的学生公寓管理信息系统.有一定实用参考价值!...
用VB+access数据库设计的学生公寓管理信息系统.有一定实用参考价值!-VB access database design student apartment management information systems. Have practical value!
- 2022-09-07 23:55:03下载
- 积分：1
-
最段路径算法C++实现 实现工程清晰可见 仅供参考
最段路径算法C++实现 实现工程清晰可见 仅供参考-Most paragraphs path algorithm C++ Realize realize the project clearly visible for reference only
- 2022-01-30 15:48: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
-
作者对ADO进行封装并演示了它的使用
作者对ADO进行封装并演示了它的使用-writer for Packaging and demonstrated its use
- 2022-02-25 21:12:53下载
- 积分：1
-
在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。
给...
在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。
给定作业序列，要求一种作业排序算法，使获得的总效益值最大。
-On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits.
For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.
- 2022-12-08 00:45:02下载
- 积分：1
-
八皇后问题解法,包括DFS,BFS和INF三种解法
八皇后问题解法,包括DFS,BFS和INF三种解法-8 Queen
- 2022-03-15 23:33:05下载
- 积分：1
-
我做的一个图书馆数据库系统，有3，4个表。适合参考
我做的一个图书馆数据库系统，有3，4个表。适合参考-I make a library database system, there are tables 3,4. Suitable reference
- 2022-04-02 00:49:57下载
- 积分：1
-
采用模版函数对数据结构的线性列表和栈以及队列进行编程。...
采用模版函数对数据结构的线性列表和栈以及队列进行编程。-template function using the data structure of the linear list and Stack and Queue program.
- 2022-07-28 16:19:24下载
- 积分：1
