为保障煤矿为例

该项目是利用SQL开发。它是专为存储是从所谓的zoneict..It网站发送具有相互关联的另一个50表中的数据。所以，如果你想知道如何使用SQL将HEP那么创建表试下。祝好运

prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.

插值类 CInterpolate 一元全区间不等距插值 一元全区间等距插值 一元三点不等距插值 连分式不等距插值 埃尔米特不等距插值 光滑不等距插值 二元全区间插值-interpolation category CInterpolate one yuan is not equidistant between the region interpolation one yuan region equidistant between 3:00 interpolation one yuan is not even fractional offset interpolation is not equidistant interpolation Hermite"s not equidistant interpolation smooth interpolation is not equidistant between two yuan region Interpolation

实时曲线类的改进增加功能: 1)采样数据存盘和加载 2)演示程序中可以实现图形的打印预览和打印功能,曲线从原点开始-Improvement of real-time curve of increasing the number of functional categories: 1) sampling data to disk and load 2) presentation graphics program can print and print preview function, curve from the origin to start

这是一个经典的寻找最近点对的算法实现，运用VC编写，采用类的方式，是程序更易理解。-This is a classic look for the nearest point of the algorithm, using VC preparation, the type used, the way the process easier to understand.

Prims算法的程序-Prims algorithm procedures

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm

本程序实现了哈希表的基本功能，以及一些附带的附属功能，可以作为数据结构的演示程序-the procedures of the hash table to achieve the basic functions, as well as some fringe subsidiary function, can be used as a data structure Demonstration Program

该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable.

access2002数据库管理实务 超星格式图书-access2002 database management practices Superstar format books