资源列表
maqtop
- 装好后再用aw6-crk.rar中的文件解密，最后在用p3zs-authorware6.rar汉化。-then packed them with aw6 - crk.rar of declassified documents, with the final p3zs - authorware6.rar finished.
EaySkin
- 装好后再用aw6-crk.rar中的文件解密，最后在用p3zs-authorware6.rar汉化。-then packed them with aw6 - crk.rar of declassified documents, with the final p3zs - authorware6.rar finished.
Ado访问数据库基本操作
- 这个程序演示了采用ADO技术的基本功能，数据库用Microsoft Acess，实现的基本功能有：添加记录，删除记录，修改记录，该程序另外一个优点在于界面的友好，Button控件做得相当漂亮。文件中包含源程序和演示用的Access数据库。-this procedure demonstrated the use of ADO The basic function, the database with Microsoft Acess to achieve the basic functions :
binsearch_star
- 一个二分查找的程序，是用mfc 编程的，可以供大家学习哦-a two searching procedures, the use mfc programming, everyone can learn oh
自由曲面的恢复
- 根据自由曲面物体的图像，提取物体轮廓，恢复曲面-free surface objects image, extracting the contours of objects and restore surface
hanoi_star_multiple_thread
- 自编的hanoi游戏，一个windows界面的程序，原理很简单，关键是多线程编程，可以供大家学习，目前这个程序还有一个小bug但是实在是不知道是什么问题，如果有那位能和我一起学习windows编程，请联系我-directed the Hanoi games, a windows interface procedures, principle is very simple, the key is multi-threaded programming, everyone can learn that
棋盘覆盖问题
- 该程序实现对残缺棋盘覆盖问题的求解 采用方法：分治方法-the program right chessboard incomplete coverage of the methods used to solve : the administration
最小生成树（Kuskal算法）
- 该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does
0-1背包问题
- 该程序用贪心算法来求解0-1背包问题 采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
二分覆盖问题
- 该程序用贪心算法来求解二分覆盖问题. 采用贪婪准则：每次从A中选择一个顶点加入覆盖，选择时：选取能覆盖B中还未被覆盖的顶点的数目最多的顶点。-procedures with the greedy algorithm to solve two hours coverage. Using greed criteria : A time to choose from a peak accession coverage options : To B coverage can not be covered
二维最近点
- 该程序实现对二维数据轴上的最临近点的求解问题 采用方法：分治方法-procedures to achieve the two-dimensional data of the axis points near the methodology used to solve the problem : the administration
一维最近点（分治法）1
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the me