全国交通算法,求最短路径,最省时间,最少工作量. VC开发的,很有借鉴意义...

完成在ODBC中进行异步调用的C程序源代码，运行环境Windows.-Completed in the ODBC asynchronous calls in C source code, runtime environment Windows.

数据结构算法，三跑道飞机场模拟。 主要是队列的算法 内容包括: 实验报告 源码工程文件-Data structure algorithms, three runway airport simulation. The algorithm is mainly queue includes: experimental report source project file

fastreport演示程序。fastreport是vcl库的下的一个报表三方控件，写的比delphi自带的报表系统好的多。(DELPHI中有bug）可以下载-FastReport demonstration program. FastReport VCL library is under a tripartite statement Control and writing than delphi"s own statements over a good system. (Delphi is bug) can be downloaded to s

计算机数据结构十日谈介绍： 本书是为“数据结构”课程编写的教材，也可作为学习数据结构及其算法的C程序设计的参考教材。本书的前半部分从抽象数据类型的角度讨论各种基本类型的数据结构及其应用；后半部分主要讨论查找和排序的各种实现方法及其综合分析比较，本书可作为计算机类专业或信息类相关专业的本科或专科教材，也可供从事计算机工程与应用工作的科技工作者参考。 -Computer data structures Decameron introduction: This book is for

sybase数据备份和还原，挺不错的，给大家看看吧，有兴趣就用-data backup and restore, they are good for everyone to see it, with interest

栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently meets the vitality one kind of construction of data form under, it has such characteristic regarding data depositing and the operation: 1) it only has a logarithm according to the port which carries on stores and takes out; 2) less advanced first leaves, namely finally the data which will store first is taken out. Its form looks like one kind of memory coin very much the small container, each time only may press in a coin from the peak, but takes out also only may carry on from the peak, namely less advanced first leaves. Such data storage and the management form are very useful in some programmings. For example, in the compiling system (this is a kind of quite complex procedure), transfe

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

多项式相加 pascal源程序-polynomial combined source

产生脉冲流密度为百万的雷达脉冲，可以对信号进行能够仿真达到给出测试的信号源环境-Have a pulse current density for the millions of radar pulse, the signal can reach is given to simulation test signal source environment

发货查询系统作业，delphi 写的,演示 数据库德操作和 打印输出-this is a test for delphi and access