-
使用WMI进行查询
使用WMI进行查询-use WMI query
- 2022-04-28 21:13:15下载
- 积分：1
-
俄罗斯方块c代码，好玩简单，易懂，快快快快看
俄罗斯方块c代码，好玩简单，易懂，快快快快看-program
- 2022-05-09 10:38:28下载
- 积分：1
-
Mobile phones turned on and off the WIFI project source code examples
开启和关闭Mobile手机WIFI的源代码工程例子-Mobile phones turned on and off the WIFI project source code examples
- 2022-03-24 08:13:52下载
- 积分：1
-
windows 内存共享 sharememey sharememey sharememey sharememey sharememey sharememey s...
windows 内存共享 sharememey sharememey sharememey sharememey sharememey sharememey sharememey -windows 内存共享 sharememey sharememey sharememey sharememey sharememey sharememey sharememey sharememey sharememey sharememey sharememey sharememey sharememey
- 2023-05-21 03:10:04下载
- 积分：1
-
Java小程序两个：一个是打印出万年历，另一个是解决一个有趣的数学问题...
Java小程序两个：一个是打印出万年历，另一个是解决一个有趣的数学问题-Java two small programs : a hefty almanac is printed out, and the other is to solve an interesting mathematical problem
- 2022-09-26 07:20:02下载
- 积分：1
-
tells you how to do the synchronization intitializer
tells you how to do the synchronization intitializer
- 2022-04-17 06:45:58下载
- 积分：1
-
a pretty practical procedures for the website, web site development and do not k...
一个蛮实用的网站程序,对于网站开发不是很了解,一起讨论讨论.-a pretty practical procedures for the website, web site development and do not know much about, and discuss discussions.
- 2022-07-11 15:12:25下载
- 积分：1
-
序列
The sequence-pair was proposed to represent a rectangle
packing and a placement, and is used to place modules automatically
in VLSI layout design. Several decoding methods
of sequence-pair were proposed. However, encoding methods
are not found except the original one called “gridding”.
- 2023-02-18 09:55:04下载
- 积分：1
-
VC6下基于MSComm控件的串口通讯接受端程序
程序基于使用VC6.0开发,专门针对串口程序调试而开发，可以在开发串口通讯时对串口数据进行监视，充当类似串口助手的作用，程序使用微软的MSComm串口控件，运行时需要在VC6中加载MS控件。
- 2022-03-18 01:20:53下载
- 积分：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
