资源列表
chatado
- 这个是我开始接触编程时的想法,想通过仅用数据库,不采用sock来实现一个简单的在局域网内的聊天室,我想这个想法很多人都有过。这个程序本身没什么价值,只是一来把自己当初的设计与大家分享,二来是有鉴于网上对ADO控件的使用这方面的介绍不是很多,自己算是抛砖引玉吧。-this my first contacts with the idea of programming, database only want to do so to achieve a sock simple LAN in the ch
数据库作业
- 简易进销存(学习用) 绝对私人开发,并非上网抄袭-summary Invoicing (to study) absolutely private development, the Internet is not plagiarism
流水作业调度
- 用动态规划法-解决流水作业调度的问题,得出最优解-use dynamic programming-solving routine scheduling issues, and the optimal solution
wymspline样条插值
- 计算方法,或者是数值计算的 wymspline样条插值 自己做的,可能不是很好-calculation method, or the numerical calculation wymspline spline interpolation themselves, may not be very good
10153_fiveline
- 五子棋联网游戏。很经典的,不过还有一些功能上的不足,这是需要改进的地方。-331 games. Very classic, but there are some functional deficiencies, and that needs improvement.
Keyun
- 客运管理程序,我认为还是很好的,我已经修改格勒,不错-passenger management procedures, I believe it is very good, I have to amend Mengele, yes
棋盘覆盖问题
- 该程序实现对残缺棋盘覆盖问题的求解 采用方法:分治方法-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