练习时做的一个老乡通信录管理系统,可从WORD中导入数据,存入ACCESS数据库中...

数据结构算法演示-demonstration algorithm data structure

该源代码为数据库设计的报刊订阅，和报告，挺详细的，适合初学者-The source code for the database design of newspapers and periodicals subscriptions, and reports quite detailed, suitable for beginners

一个适用于书店的图书管理信息系统，包括各种统计分析、员工管理等-a bookstore in the library management information systems, including statistical analysis, staff management etc.

数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法-algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.

主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前、中、后、层次遍历和相关的操作。另外，可以树形显示这棵树的信息。-Some properties are mainly binary operation. Including reproduction, empty, to strike a tree height, the number of elements in the tree get root node, the father node, all the ancestors, the left son, right son, insert the left son, right son, to find an element, and the former , during and after, hierarchical traversal and related operations. In addition, you can display tree tree information.

严蔚敏的数据结构源码及演示系统，有助于形象直观的学习数据结构-YAN Wei-min source of the data structure and presentation systems, the study will help the image of intuitive data structure

程序是要建立一个哈弗曼树，并利用哈夫曼树求相应编码和译码，根据输入的一串电文（字符串）来设计哈夫曼树，并根据哈弗曼树求出每个字符相应的编码，最后根据已知的编码，随机组合输入编码串，根据哈弗曼编码和哈弗曼树求出译码内容。 主要输入形式为一串字符串例如：abcd 输入的范围就是这26个字母，不限大小写，定义最多输入的字符不超过100个。 输出的形式根据要求，输入字符串后，要输出每个字符及其权值（出现次数）； 然后再输入要译码的编码串，输出译码内容。

(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

图的建立与多种遍利方法-map and the establishment of a variety of methods !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! good times

uart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreuart 块 coreu