-
fangchengqiujie ......
实现一般的方程求解,可以四册运算-fangchengqiujie ......
- 2022-02-01 07:17:22下载
- 积分:1
-
从URL下载文件
从URL下载文件,它可以很容易地通过使用Windows API函数URLDownloadToFile完成通过包括单位“URLMON”或Urlmon.pas在您的项目。
- 2022-08-03 02:13:33下载
- 积分:1
-
200308141526117224仿MSN(网易泡泡)界面,从事及时通信开发人员
200308141526117224仿MSN(网易泡泡)界面,从事及时通信开发人员-200308141526117224, imitating the interface of MSN, fitting with betimes communicatting developer
- 2022-03-01 06:20:16下载
- 积分:1
-
Self
自学c++半月通,pdf格式,分15天,循序渐进-Self-c++ Half pass, pdf format, at 15 days, step-by-step
- 2022-04-07 13:08:58下载
- 积分:1
-
MPI array to calculate the diffrent in numbers
MPI array to calculate the diffrent in numbers
- 2022-02-01 20:08:53下载
- 积分:1
-
很小的五子棋C语言程序,有中文注释,以供学习
很小的五子棋C语言程序,有中文注释,以供学习-Small Gobang C language program in Chinese annotations for learning
- 2022-08-12 21:28:04下载
- 积分:1
-
K r u s k a l算法每次选择n
K r u s k a l算法每次选择n- 1条边,所使用的贪婪准则是:从剩下的
边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选
取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步,其中e 是网络中
边的数目。按耗费递增的顺序来考虑这e 条边,每次考虑一条边。当考虑某条边时,若将其
加入到已选边的集合中会出现环路,则将其抛弃,否则,将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
- 2023-02-08 08:10:04下载
- 积分:1
-
examen 1, 2 and 3 of icarnegie ssd4
examen 1, 2 and 3 of icarnegie ssd4
- 2022-06-19 19:09:21下载
- 积分:1
-
基于VS2013的C#网络数据包抓取程序
基于VS2013的C#网络数据包抓取程序包含整个工程
- 2022-04-14 16:05:41下载
- 积分:1
-
基于qt5的STM32 BootLoader和APP程序合成工具
使用qt creator 5.7.1版本,基于QWidget 开发的,用于STM32单片机,BootLoader程序和app应用程序的合成工具,可选择输出合成的hex文件路径。
- 2023-04-08 16:30:04下载
- 积分:1