vc++文件教程中的例子 mfc中网络方面的的 下去看吧 挺有意思的...

(一个比较简单的日历)-(a relatively simple calendar)

一个简单的程序，有源代码提供，一个网络进程演示，是VC++编写的-A simple procedure, active code, a network process of demonstration, is VC++ Prepared

资源描述基于openCv的图像处理，相似图像识别和提取！运行时需要安装opencv。

6000元的视频聊天软件 -dsssssssssssssssssssssssssssssssssssss

15-拼图是滑动拼图包含一帧的编号正方形瓷砖按随机顺序与一瓷砖丢失。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

滚动条使用实例程序-examples of the use of the rolling process

MFC控件，树形，像资源管理器一样，实现树形获取文档的功能-MFC control, tree, like the Explorer, the same access to the document to achieve the function tree

WDF解包工具 WDF解包工具 WDF解包工具 WDF解包工具 WDF解包工具 -wdf Resource Kit readerwdf Resource Kit readerwdf Resource Kit readerwdf Resource Kit readerwdf Resource Kit readerwdf Resource Kit reader

这个文件用于打开端口，祥细注释的功能可以从代码中获得，有问题可以查看注释。-this document to open the ports, wound Notes of the functions can be obtained from the code, a problem can view the Notes.

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.