识别和矢量化等高线图，可以从光栅实现…

打字速度测试！可以在WINDOWS 下直接运行..翻译. 开发工具：VB-mesure the speed of inputing word.directly run under windows.by vb.

通用人事管理系统,实现公司的职工资料管理,工资发放管理.人事管理-General personnel management system, information on the company" s staff management, payroll management. Personnel Management

windows 剪贴板的实现源代码-the realization of the source code

Kill Process using api windows VB6 source

带头尾指针的list，可以使用任意数据类型替换例子中的类型，实现从尾部插入元素，从任意位置删除元素。-lead the list tail pointer can be used to replace arbitrary data types examples of types, from a tail insert elements from any location delete elements.

一个用VB编的Block，便于初学者学习 和了解一些简单的算法-One with the VB compiled Block, easy for beginners to learn and understand some simple algorithms

阿木自己做的简单界面程序,里面用到一个DLL文件是网上找的.大家看看吧.-Amu doing simple interface procedures inside a DLL file used by Internet to. We look at it.

是文件格式缩进的,基于c++的,没有涉及window,有点老土-is indented file format, based on the c and no window, a bit old fashioned

石器时代服务端6.0源代码,大家慢慢研究吧!-Stone Age 6.0 server source code, we study it slowly!

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right