这是用VC++开发的交通灯的应用程序,可以模拟交通灯

基于IDL和VisualC_的混合编程，详述了IDL语言，并实例演示两者的调用-Based on IDL and VisualC_ mix of programming, detailing the IDL language, and examples of presentation between the two calls

读写程序,一个简单的文件，可以用来读写二进制文件-Reading and writing program, a simple document that can be used to read and write binary files

2812安装功能详解，可以让大家学习到CCS的基本程序-2812 install Answer Center, you can let everyone learn the basic procedures for CCS

汉字显示程序Display HanZI-Chinese character display program Display HanZI

这是冠以VC异常及异常处理类的使用用法，加上实例的说明，使你能很快不如编程的殿堂-This is called VC abnormal and unusual class of the use of usage, coupled with examples of the note, so that you can quickly program as a hall

密度算法 将具有足够高密度的区域划分为簇，并可以发现任何形状的聚类 算法基本思想 1 指定合适的r 和M 2 计算所有的样本点，如果点p的r邻域里有超过M个点，则创建一个以p为核心点的新簇 3 反复寺找这些核心点直接密度可达（乊后可能是密度可达）的点，将其加入到相应的簇，对于核心点发生“密度相连”状况的簇，给予合并 4 当没有新的点可以被添加到仸何簇时，算法结束

一个控制windows系统关机、注销和重启的小程序，windows xp下可以。

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.

.NET 多语言解决方案 .NET 多语言解决方案 .NET 多语言解决方案 .NET 多语言解决方案 -. NET multi-language solutions. NET multi-language solutions. NET multi-language solutions. NET multi-language solutions. NET multi-language solutions. NET multi-language solutions. NET multi-language solutions

button的小例子,后边会有质量更高的-button small examples, will be behind the higher quality