数据结构常用算法程序集1，描述数据结构算法。

利用人大金仓提供的kci接口实现对数据库的访问，主要提供了数据库的连接、断开连接、执行增删改查和事务开启、事务回滚、事务提交等操作。此外还提供了数据库连接池和监控线程、维护线程从而提供数据库的访问效率，是一个不可多得的Kci封装接口。

该系统是用vb6.0开发，连接数据库，有原代码设计，有详细的设计说明，可以自己更改程序。-The system is used vb6.0 development, connecting to the database, the original code design, detailed design specifications, can change its own procedures.

用C语言编写的贪吃蛇游戏，运行是按任意键开始，不过呢，反向也算输哟！-Using C language game of Snake, run is started by pressing any key, however, the reverse also count yo loser!

二叉树操作&图的遍历操作， 完全按照里面的文挡用VC所完成的程序， 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in

这里采用了C++里随机的一个函数,通过修改,顺利变成一个在指定范围内随机抽取数据的函数,并且不重复抽取-here C. Lane used a random function, through the revision, smoothly into a designated area in random data function, and does not take repeat

jdbc driver

将xml格式的文件导入到 数据库中,将xml格式的文件导入到 数据库中-Xml file will be imported into the database, the xml file into database

节点类，提供了全套节点相关处理函数-category nodes, providing a complete set of nodes Functions

图的建立、遍历、最小生成树、最短路径 图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time