Mainly for the VC database programming use, a detailed description of the ODBC a...

按克鲁斯卡尔（Kruskal）算法思想，编制一个寻找最小生成树的完整的程序。

数据结构霍夫曼编码译码程序-data structure Hoffman codecs procedures

客户管理系统使用ASP.NET和Acce-Customer management system using ASP.NET and Access

完成输入图，然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal

c 的一些经典算法,满好的,适合初学者. 也可以当作小程序看,对初学者会很有帮助-c some of the classic algorithms, over a good, suitable for beginners. can also be read as a small program, it would be helpful for beginners

在本次课程设计中，应该以实际情况为主，在此基础上实现对实际情况的抽象，并设计和建立数据库，完成应用程序界面的人性化地编写。 -During the course design should be based on the actual situation in the main, on the basis of the realization of the abstract of the actual situation and the design and establishment of databases, application programming interfaces to complete the preparation of humanity.

关于差分方程的一个程序，很简的二维椭圆方程，区域是1x1-differential equations on a procedure for the very simple two-dimensional elliptic equation, the region is 1x1

一个增加数据库字段的例子，db数据库格式，有兴趣地可以实施 -an increase in database fields example, db database format, with interest can be implemented

快照建立步骤及维护- The snapshot establishment step and maintains

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.