用VFP编的电脑查询系统,比较简单,适合初学者参考.

1、读入城市结点数据 */ /* 2、邻接矩阵初始化：所有元素赋Infinity， */ /* 对角线元素赋0 */ /* 3、读入城市间边的数据，转换为邻接矩阵的数据 */ /* 4、路径矩阵初始化，若arc[i][j]

o-r mapping 实现以面向对象的方式建立对关系型数据库的映射。-o-r mapping in order to achieve the object-oriented approach to the relational database mapping.

运行程序，打开程序主界面，在屏幕录像模块的主窗体中，用户可以设置录像文件名和存储位置，并可以进行录像和抓图，还可以对已有录像文件进行播放、重命名、另存为、查看时间和删除等操作。

字符频度统计，采用Hash表即链表数组作为存储结构,是hash表的简单运用，还包括一定的文件操作-characters frequency statistics, the use of Hash Tables List that as a storage array structure, hash table is a simple application, but also some file manipulation

一个演示如何根据数据库动态建立访问数据库的DSN程序。-a demonstration of how dynamic database access to the database to establish procedures for the DSN.

01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

本代码实现并比较了直接插入排序，选择排序，冒泡排序，快速排序，两路合并排序，堆排序，同时可视化比较了他们的时间复杂度，代码完整可行，有可执行文件直接运行。

学校超市选址问题（带权有向图的中心点）

If you have ever wanted to store data temporarily in your Delphi Win32/.Net, C++ Builder or Kylix application, and you at the same time wanted full access to the data as if they were stored in a database table, you have the right solution here. kbmMemTable is a full TDataset compatible in memory table loaded with functionality.