一个小公司管理系统

数据结构里的拓扑排序和非拓扑排序算法，用vc6.0编写-data structure, the topological sorting and topological sorting algorithm used to prepare vc6.0

vfp编写的简单计数器.可以轻松实现计数,清零等功能 -Probe preparation of simple counters. Easily count, reset function

著名的环形缓冲区算法，欢迎大家使用下载，好东西呀。-Well-known ring buffer algorithm, welcome everyone to use the download, you good things.

网络最短路径Dijkstra算法-network Dijkstra shortest path algorithm

车厢重排,一个c++数据结构习题-compartments rearrangement, a data structure c Exercises

应用背景interface uses   SysUtils, Classes, DB, DBClient, superobject, ADODB, EncdDecd; function DataSetToJSON(ADataSet: TDataSet; var AJSON: WideString): Boolean; function JSONToDataSet(AJSON: WideString; ADataSet: TDataSet): Boolean; overload; function JSONToDataSet(AJSON: WideString; ADataSet: TADODataSet): Boolean; overload; function JSONToDataSet(AJSON: WideString; ADataSet: TCustomClientDataSet): Boolean; overload; implementation (*   C: 配置表     Encode 字符编码       0:ANSI 1:UNICODE 2:UTF-8       默认 1     BolbComp 二进制字段是否压缩       0:未压缩 1:已压缩       默认 0     CompMode 压缩模式       0:ZIP 1:RAR 2:7-ZIP       默认 2     BolbEncod

别处找来的红虎日记源代码-elsewhere When a red tiger diary source code

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)

SQLite浏览器-1.3-src.tar.gz文件伟大的

航空信息管理系统-Aviation Information Management System