Data structure, Tsinghua University Press, courseware, edited by Yan Wei

本程序演示了如何使用编辑器在运行期设置表格的一些常用参数 需要使用到Ehlib控件,最好使用3.6版本,旧版本也适用! 使用前请双击本目录下的DB.UDL连接数据库,连接完成后即可选择数据表进行演示! 在表格上按右键,即可出现功能菜单,点击进入! 程序应该适用于各版本的DELPHI,但由于条件有限未做测试!-This procedure demonstrates how to use the editor in the run-time set up tables need to use some common parameters to Ehlib control, it is best to use 3.6 version, also applies to older versions! Before use double-click the catalog under DB.UDL connect to database, connectivity be able to choose after the completion of data table demo! Right-click in the table can function menu appears, click to enter! procedure should be applicable to all versions of DELPHI, but due to limited testing done!

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

this is fp tree algorithm in java

迷宫问题与运动会,有丰富的实例与测试数据，是学习数据结构的较好的资料！-Maze with the Games, has a wealth of examples and test data, data structure to learn the information better!

数据结构是编程的基础，本例是本人写的八个基本数据结构的实现方法，用C语言编写，在VC中调试成功，并带有少量的注释，有兴趣的可以研究一下。我在里面尽量使用了指针-data structure is the basis for programming, which in this case is I wrote the eight basic data structure of the method, using C language, in VC debugging success, and with a small amount of the Notes may be interested in the study. I try to make full use of a guideline

Realiza inventarios no terminado

考勤管理系统源码-Attendance Management System FOSS

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

用vb模拟dbms程序-with vb simulation procedures DBMS

dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法-Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm