BorlandBGI examples do not know whether we used to have hope that we can contact...

高质量C++编程指导 一些编程规范和常见的容易犯错误的地方-High-quality C++ programming guide the number of programming norms and common areas prone to making mistakes

和windows xp的扫雷功能完全一样，目前没有 发现bug-Windows xp and function exactly the same as mine-sweeping, there is no bug did not find

救护车模拟调度系统-ambulance dispatch system simulation

200405181013101213聊天程序（客户端），及时通信开发-process of chat (client), communicating in time

该工程为WDM驱动，采用DriverStudio进行编译。其中包含IO操作，及DMA传输。 如果有PLX9054的板卡，可以直接安装测试。

适合初学者使用的烟花java源代码 没有使用swing 可以为初学者打下良好基础-for beginners fireworks java source code is not used for the swing can lay a good beginners basis

创建互斥名的完整的例子-were created contradict the integrity of the examples

一个结合了mfc/winsock/多线程等技术实现的聊天程序，只有聊天功能，但是用于广泛，主要适用了tcp链接，udp打洞技术.-A combination of mfc/winsock/multi-threading technology to achieve a chat program, and only chat, but for a wide range, mainly applicable to the tcp link, udp holes technology.

一个基于 BIOS 的屏幕开发的 C 语言源程，有点意思，欢迎大家快乐共享-a screen-based BIOS development of C language source way, a little bit mean, we are happy to share happiness! !

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.