使用JFREECHART组件 读取数据库数据，生成柱状图，

这是 apriori 算法的数据挖掘工具。 c# 和.NET 2.0，很容易理解，您可以重写它，使它更有效率。

(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

这是数据结构中图的全部实现代码，对学习数据结构的同学很有帮助-this is a code of data structure

一共建6个表： 1) 购物表Trade_List（Trade_ID，Product） 2) 频繁一项集Apri

实现学生基本信息、选课信息及成绩的增、删、改、查功能。-Achieving students to basic information, elective information, and performance increase, delete, change, check functional.

该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用-The source function is to realize Huffman coding, that is, the optimal tree structure is a character interface, and the sense of self, to do good, debugging adopted, the absolute ease of use

数据结构：用链表做存储结构求两个一元多项式相加的结果-Data structures: The linked list storage structure seeking to do two one dollar sum of the results of polynomial

数据结构中的几种基本结构的C++实现：栈、队列、链表-data structure of several basic structure of the C achieved : Stack, Queue, Listless

一个数据结构的实验报告的小程序.用c++写的.-a data structure of the small experimental procedures. Using c writes.