哈夫曼树的基本运算与实现的基本算法，对于数据结构初学者很有用...

摘要：可以对本地数据库进行查看，修改的程序，提供了源代码。-Abstract : It is the local database view, the procedures for amendment, the source code.

数据统计后生成图表，适用于报表等，简单实用！-data generated graphics, applicable to such statements, simple and practical!

使用VC++对Excel的数据读取，使用VC++6.0编写，含有《odbcinst.h》头文件编写,如果还有疑问请发邮件给我-use Excel to read the data, the use of VC 6.0, containing "odbcinst.h" The first document preparation, if still in doubt please send an email to

用四种方法实现对随机的10000个数的排序，并比较这四种方法性能的差异。-Four methods used to achieve the number 10000 on the random sequencing and comparing the differences in the performance of four methods.

图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such as the shortest path to map the way! VC interface!

C++数据结构树结构类定义及有关算法-C data structure tree structure type definition and the algorithm

从Visual C++中用Access自动生成报表-from using Visual C Access automatically generate statements

树形结构的逻辑和存储特点。 二叉树的遍历递归算法。 -tree

(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

经曲的字符串匹配模糊搜索算法 思想不是本人的，但程序是本人编写的-By the song