定期储蓄管理软件，可存款，取款，挂失，取消挂失，信息输出等功能...

详细介绍了PC-ACCESS的安装步骤和VB客户端的编写实例，而且还有注释，清晰易懂，并且编写了独特的西门子200PLC的通信实例，详细步骤让人眼前一亮，值得前来看一看。也期待能和各位高手交流！！！

CRC校验 Visual Basic源代码-CRC Checksum Visual Basic source code

题目：有两个磁盘文件A和B,各存放一行字母，要求把这两个文件中的信息合并（按字母顺序排列）， 　　　 输出到一个新文件C中。-topic : There are two disk files A and B, the store his letter, the requirements of these two documents, the information merger (in alphabetical order), the output to a new file C.

在DELPHI程序中获取网络资源信息-the process of information access network resources

SSP从机器实验！可以配置从机通信，朋友门可以参考一下...希望对大家有帮助！-SSP from the experimental machine! Can configure communications from the plane, friends can make reference to the door ... we want to help!

一个vc7工程向vc6工程转化的程序--A procedure which can convert the project from VC7 to VC6

《Visual C++案例开发　中换肤程序小例程的源码-"Visual C cases Development Eurocargo procedures routines of small-source

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.

Weather Effects Demo

wtl helper