-
Diophantine 丢番图的求解,很经典,也很简单
Diophantine 丢番图的求解,很经典,也很简单-Diophantine
- 2023-03-12 22:15:03下载
- 积分:1
-
MatlabMie
米氏散射理论的matlab模拟,球粒子Mie散射(含蒙特卡洛仿真)(Matlab simulation of mie scattering theory)
- 2021-04-12 15:58:57下载
- 积分:1
-
非正交多址系统资源分配研究综述_王正强
文中包含NOMA资源分配相关工作的总结
文中包含NOMA资源分配相关工作的总结(NOMA)
- 2021-03-04 12:29:33下载
- 积分:1
-
网关+登录器套件
说明: 冒险岛登录器网关+登录器套件,只提供参考。(Adventure Island Logger Gateway + Logger Suite, only for reference.)
- 2019-03-08 01:21:47下载
- 积分:1
-
ADB-FRP (Nokia)
说明: VNV GJB HJKFXC JFHJKFSD KHJDF FDHJK ND
- 2019-06-03 02:44:37下载
- 积分:1
-
GTcall
公通软电话,市话,长途都是8分钱。注册一下平台,用户名和密码就可使用。-GTcall
- 2023-01-24 21:30:04下载
- 积分:1
-
spring-lib
说明: spring框架的jar包,适合老版本jdk,新版本的jdk启动有问题(Document editor, can open various types of text files, very convenient. Strongly recommended)
- 2020-06-16 07:40:01下载
- 积分: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
-
KLT-master
KLT算法搜索,经典算法,推荐大家下载,CMU的博士论文(KLT algrithm searching)
- 2017-08-03 23:26:31下载
- 积分:1
-
讲述了代码阅读的许多技巧,对做二次开发的人员来说,真是葵花宝典啊。...
讲述了代码阅读的许多技巧,对做二次开发的人员来说,真是葵花宝典啊。-code reading about the many skills to do the secondary development of staff, is a treasury of sunflower ah.
- 2022-07-10 11:45:40下载
- 积分:1