实例看Windows API程序设计

查看文件信息的源代码！！非常简单！研究下还可以（对向我这样的菜鸟哈）-View file information source code! ! Very simple! Studies also can (right to me the newcomers Kazakhstan)

ping tool, use vc6 compile passed

算法内容：首先将二维灰度图像抽象为三维地形，横纵坐标表示经纬度，灰度表示高度，这样就产生了一个地形图，地形中有高山有盆地，我们的任务就是找到盆地并且给盆地划定地盘。  算法过程，将最低点（灰度）作为起始点，开始从下注水，想泉水一样，水位逐渐上升，所有点都是上下透水的，但不会横向流动，每产生一个新的积水盆地时标记这个盆地使之与原有盆地区别开，当两个盆地内的水要汇集的时候，在此点建立一个水坝，将水分开，此水坝无限高，水永远不会溢出，依次建立所有水坝，最后的水坝就是所谓的分水岭或分水线，也就是得到的分割线。 

求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes

44个实用VB小技巧的打包 -44 VB practical skills of small packages

SSD algorithm in computer vision source code

source code for the examples from Mike Smith s book "Java: an Object-Oriented Language".

已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right numbered 1,2, ..., n, also know that two adjacent numbers between nodes ChonSu (this tree that links these two nodes in the path of the number of edges). Seeking any two leaf nodes x, y (1 ≤ x ≤ n) between the ChonSu

以前,从别的网站上看到的.认为还不错,所以也分享出来,大家一起看看.当然我的水平太差.-ago, from somewhere else on the site to see. That was pretty good, so shared out, we take a look at. Of course, my level of impairment.

一个对wince的注册表进行操作的源代码。-Wince a registry for the operation of the source code.