-
mk检验
说明: 对水文序列进行mk检验并绘图,置信区间为0.05(MK test and mapping of hydrological series)
- 2020-12-18 17:08:45下载
- 积分:1
-
xgboost-master
预编译的xgboost,有安装示例。。。。。。。。。。。。(Pre-compiled xgboost, there are installation examples...)
- 2019-03-18 11:30:48下载
- 积分:1
-
FinalScheduler
说明: 终极排班管理系统,改变传统的排班模式!
使用技术: JFinal2.0 + Bootstrap + SeaJS + FullCalender.js(源码修改二次开发)
数据库:MySQL(Ultimate scheduling management system, change the traditional scheduling mode!)
- 2020-06-21 23:40:01下载
- 积分:1
-
最新的水表检验规程,这个很重要的!特别是从事表类行业的兄弟们!谢谢你们的支持,我们一起进步!...
最新的水表检验规程,这个很重要的!特别是从事表类行业的兄弟们!谢谢你们的支持,我们一起进步!-Latest meter test a point of order, this very important! Particularly those engaged in table-type industries brothers! Thank you for your support, we progress together!
- 2022-03-22 23:27:43下载
- 积分:1
-
wenjianmanager
An Android File Manager source code that supports decompression can also be used for routine operations such as copying, moving, deleting and renaming. When compressing files, they can only be compressed into ZIP format, not rar format. Decompression also supports ZIP format tightly. Source code has more detailed annotations.
- 2020-06-22 19:40:02下载
- 积分:1
-
T_PMMA-水结构仿真_180718
声学仿真。模拟声柱在comsol的情况。声学入门案例,适合初学者(Acoustic simulation. Simulated sound column in COMSOL. Introduction to acoustics, suitable for beginners)
- 2020-10-20 14:27:25下载
- 积分:1
-
ExcelOperate11
vc读写excel,这个是用mfc写的,基于对话框的小程序(Vc u8BFB u5199excel)
- 2017-05-25 11:34:36下载
- 积分:1
-
string
C++ 编写的string类库,并实现string的各项函数操作。(string function)
- 2013-05-07 16:27:28下载
- 积分:1
-
www
j简单的一个计算器C++源代码,乱七八糟了,随便(j simple calculator C++ source code, Messy, and not)
- 2007-07-14 13:37:24下载
- 积分:1
-
Create a storage structure of a given graph from the adjacency list and adjacenc...
1 创建给定图的存储结构,从邻接表和邻接矩阵两种存储方式中选择一种。
2 对所创建的图进行深度和广度优先搜索遍历,给出遍历过程中的顶点序列。
3 求图的最小生成树,按构造顺序输出边的序列。(两种方法都要求!)
3 编写一个主函数,将上面函数连在一起,构成一个完整程序。
4 将实验源程序调试并运行。
-Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
- 2022-04-16 10:47:00下载
- 积分:1