“气球式”工具提示: 本程序介绍一个与CToolTipCtrl相似的类CTooolTipWnd，用于实现“气球式”工具提示...

在程序中如何获得和修改目录的日期和时间，包括源玛，编译后的文件-the process on how to obtain and modify the directory date and time, including the source of Thomas and compiled the documents

windows sever 2008 激活-windows sever 2008 ??活

图书管理小程序，可以添加图书（需输入正确的ISBN码），显示图书菜单，-small library management procedures can add books (with the correct ISBN codes), indicating that library menu,

ImageButton的简单demo.-ImageButton simple demo.

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.

vc学习的源代码-source code for VC learning

扑克牌的游戏，有兴趣可以试一下-poker games, interested Try

；

一个定时关机程序vc++ -a regular shutdown procedures vc

一种新的产生参考数据的方法构造条件统计量的方法-A new method for selecting the reference structure condition statistic methods