-
thank you for using this software,which is fugai method,when you can t catch it,...
thank you for using this software,which is fugai method,when you can t catch it,please ask me for my help!
- 2023-09-03 02:30:03下载
- 积分:1
-
人脸识别
这个 VI 可以允许您通过使用 Labview 使用人脸识别,首先您需要设置您的模板 (嘴巴、 鼻子和眼睛) 然后替换 pnj 文件后,您可以运行和程序来做这个工作
- 2023-04-26 00:00:04下载
- 积分:1
-
这个是BRISTOL大学 大二的作业. 当时得了90多分所以如果有国外留学生朋友可以看看....
这个是BRISTOL大学 大二的作业. 当时得了90多分所以如果有国外留学生朋友可以看看.-University sophomore operations. Then scored more than 90 hours if there are foreign students friends can see.
- 2022-03-20 06:20:55下载
- 积分:1
-
一个不错的哦????呵呵!下吧!哈哈够了吗/
一个不错的哦????呵呵!下吧!哈哈够了吗/-a good Oh Oh! Next! Haha enough yet /
- 2023-07-28 05:45:03下载
- 积分:1
-
基于C语言的内部收益率法
此内部收益率法用的是
- 2022-07-03 20:17:59下载
- 积分:1
-
一个利用SQL语句更新数据的小工程,大家有空可以
一个利用SQL语句更新数据的小工程,大家有空可以-SQL statement to update data using a small-scale projects, we can look at empty
- 2022-07-25 11:58:48下载
- 积分:1
-
一个小型图书管理系统,用PHP和MYSQL实现,可以帮助初学者很快入门,进入实战!...
一个小型图书管理系统,用PHP和MYSQL实现,可以帮助初学者很快入门,进入实战!-A small library management system, using PHP and MYSQL implementation, beginners can quickly assist entry into the battle!
- 2023-02-23 14:40:03下载
- 积分:1
-
GPS数据采集程序,涉及仪器接口操作,以及数据处理与解析,多线程,是个比较完善的例子...
GPS数据采集程序,涉及仪器接口操作,以及数据处理与解析,多线程,是个比较完善的例子 -GPS data collection procedures, involving operation of equipment interfaces, as well as data processing and analysis, multi-threaded, it is a relatively perfect example
- 2022-01-24 17:00:04下载
- 积分:1
-
Cartoon make
卡通拼版游戏。也是小时候很经典的玩具,回忆一下童年的快乐时光吧-Cartoon make-up game. Is also very classic childhood toys, recall the childhood you had a wonderful time
- 2022-03-22 02:38:00下载
- 积分: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