Delphi中实现把数据集中的数据导出为word

这是关于01背包问题的动态规划算法。采用C++语言完成的，代码间有注释。-This is about 01 knapsack problem dynamic programming algorithm. Using C++ language completed, there are comments between the code.

数据库设计基础 供数据库初学者参考 比较好的资料-Database design based on reference for database beginners relatively good information

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

ADO使用和封装的例子，很实用-ADO use and Packaging example, a very practical

(1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights

开发环境:VC++6.0+MFC 数据库:Oracle 8.0 请将oraclm.dll拷贝到运行文件的目录中! 要运行例子要先装Oracle 8.0，如果有什么问题，请看你机器上的Oracle安装目录下的mshelp/Oraclec.hlp。-Development Environment: VC++ 6.0+ MFC Database: Oracle 8.0 Please oraclm.dll files are copied to the run directory! To run the example of first installed Oracle 8.0, if there are any problems, see your machine to install the Oracle directory mshelp/Oraclec.hlp.

这是一个有序链表的生成和插入的源码。用C++实现。-This is an orderly list of the generation and insertion of the source. With C++ Realize.

使用perl和C写的基于Web的管理数据库表的程序- Uses perl and C writes based on the Web management database table procedure

作业练习题 你们-workbooks that you s

Oracle BerkeleyDB--SQLitehttp--www_sqlite_com_cn-_files2.rar//bdb2