-
用VB编写的去重程序,可以实现对TXT文件的去重复数据的处理,内含源代码。...
用VB编写的去重程序,可以实现对TXT文件的去重复数据的处理,内含源代码。-Prepared to use VB to re-process, can be achieved on the TXT file to deal with duplicate data, including source code.
- 2022-10-29 13:55:03下载
- 积分:1
-
首先指定要查找的目录,然后填入要查找的文件名,注意到带扩展名 也可以查找文件夹....
首先指定要查找的目录,然后填入要查找的文件名,注意到带扩展名 也可以查找文件夹.-first to find the specified directory, and then you have to fill in the name, notes with extension can also find folders.
- 2022-01-31 13:28:30下载
- 积分:1
-
windows环境下基于QT的串口,MP3,carema等功能软件
windows环境下基于QT的串口,MP3,carema等功能软件,融合了很多功能。
- 2022-02-06 03:20:40下载
- 积分:1
-
this small program can help you fast access to Ethernet addresses and IP address...
这个小程序可以帮助你快速获取网卡地址和IP地址-this small program can help you fast access to Ethernet addresses and IP addresses
- 2023-04-17 20:00:03下载
- 积分:1
-
简单的数据平台,能打开系统目录,能画图,是VC++编写的
简单的数据平台,能打开系统目录,能画图,是VC++编写的-Simple data platform, can open the system directory, can draw is VC++ Prepared
- 2022-02-12 16:45:47下载
- 积分:1
-
完整的列表浏览器,可以提取和未提取所有检查类型。我有美国..
Complete List Viewer that can extract and un extract all checked types. i have used this vcl in my projects. enjoy boys and girls!
- 2022-03-13 09:06:05下载
- 积分:1
-
ans1server通讯服务器端
ans1server通讯服务器端-ans1server communications server
- 2022-10-13 09:40:02下载
- 积分:1
-
一个界面非常漂亮的易语言程序源码 可以借鉴学习的
一个界面非常漂亮的易语言程序源码 可以借鉴学习的-A very beautiful interface, easy-language program source code can learn to learn
- 2022-03-11 06:30:36下载
- 积分:1
-
- 2022-01-21 22:27:38下载
- 积分: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