tessnetOCR,C#实现用于验证码解析

vsp的一个示例代码

torque 的经典教程 全面的介绍torque 适合初学者 很难找哦-torque of the classic hard to find Oh tutorial

关于avltree的源码，大家可以学习一下了-On the source avltree, everyone can learn about the

是一个歌词搜索的小程序,是VB的.可以在网上搜索歌词.-lyrics is a small search process, the VB. The online search lyrics.

一个在VC中使用ASM的程序，欢迎大家下载使用，如有问题，请留言联系。-a VC in the use of the ASM procedure, all are welcome to download the use, if there are questions, please contact messages.

mapx + c++ 实现标准例子 来自mapinfot-MapX c achieve the standard example from mapinfot

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++工程中加入 SplashScreen 原理释解-VC works include Principle allay SplashScreen

简单zizag扫描算法，zizag遍历输出数据-CV zizag scanning algorithm, according to zizag output data

一个可以产生随机数并且计算的源程序-can have a random number and the source calculation