《C语言实用培训教程》源代码，可供初学者学习使用

vb.net程序，程序的目的是联系隐藏程序本身到任务栏！-vb.net procedures, procedures are designed to link itself to hide the task bar!

一种俄罗斯人常用的隐藏进程和启动该服务的方法，一定会令大家耳目一新的。-Russians used a hidden process and the start of the service, we would certainly be refreshing.

本程序介绍如何判别并定位到光驱软驱,并进行读写-the procedures on how to identifying and positioning of the floppy drive, and write

一些C++源码，相信对大家很有帮助，特别是对于初学C＋＋的新手来说更是如此。-Some C++ Source Code,it s useful to the beginner of C++ language.

透明位图的显示方法，方法步骤比较清晰，欢迎下载-Transparent bitmap display methods, methods are more well-defined steps are welcome to download

3D sdk练习 关于一个小物体插件的制作，源于SDK的HLP文档，2005格式-3D sdk practice on a small object plug-in production, the HLP from SDK documentation, 2005 Format

从一本书附带代码修改而来 删除邮箱所有邮件（用于清除大量垃圾邮件） 自己修改内设的帐号和密码-book from a fringe code revision to delete mail from all mail (for the removal of huge quantities of spam) to amend their internal account and password

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.

Codigo simetrico en C#

一个样子和东方快车浮动条相拟的汉化小工具。-a look and the Orient Express of the floating phase of the effort to be small tools.