共有4个数据结构的实例

用VB6.0进行solidworks的二次开发，包括数据库操作，零件的参数化生成等应用。-SolidWorks using VB6.0 for secondary development, including database operations, parts of the parametric generation of applications.

金蝶K3数据字典 K3erp数据库 表结构 -K3 Kingdee K3erp data dictionary database table structure

自己设计的一个简易的考勤管理系统，所使用的数据库为acce-a simple time and attendance management system，using access as database system

医药及销促系统，自带数据库-medicine and promote sales systems, onboard database

数据结构第三章中栈和队列的源程序，实现了全部算法-this is a code of data structure

双向链表的各种操作（包括建立，插入，删除，查找等）-Two-way linked list of a variety of operations (including create, insert, delete, search, etc.)

1、 用随机数生成的方式（要求用户输入随机数）产生一个迷宫：“1”表示墙，“0”表示路，最后的路径用“8”表示，若没有路径则打印报文，若有路径则打印出路径。 2、 通过堆栈及判断实现迷宫的自动寻找路径功能 -1, the random number generator of (requiring user input random number) produces a maze : "a" Wall said, "0" Lu said, the final path with "8" that if no path was reportedly Print text, if it were printed out trails path. 2, stack and judgment to achieve the labyrinth path function to automatically search

access转换为execl,方便打印报表-access into execl facilitate print statements, etc.

本程序是实现二叉树跟树的常用算法，都是尽量用非递归来编写的。关于二叉树的都可以从键盘动态输入，关于树的就不可以，原因是树的结构问题，在程序中，树的建立用到动态左孩子/右孩子建立-this program is a binary tree with the tree is commonly used algorithm, as possible, to use non- recursive prepared. On the binary tree can be dynamic input from the keyboard, on the tree will not be able to because of the tree structure, in the process, the tree is used to establish dynamic children left/right to establish child

网络优化算法：任两点间最短路径问题的BellmanFord算法-Network optimization algorithms: the shortest path between any two points BellmanFord algorithm issues