使用贪心算法实现PRIM最小生成树算法.经典的算法题目.

Video rent program. simple

这是一则无刷新发帖的实例，也是对Ajax的一个实际应用，后台是Apache+PHP,数据是文本(之所以考虑文本方便，数据库的话还要先安装，反而搞的复杂，所以采用文本。当然了，实际应用当中是采用MySql还是文本可以另选)-This is a refreshing post had no examples of Ajax is also a practical application, the background is a Apache+ PHP, the data is text (the text is having convenient, if the database should be installed, but are engaged in complicated, so use a text . Of course, the practical application of which is used MySql or text can elect)

prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.

关于数据库的源代码。适合初学者参考如何使用数据库。-With regard to the database source code. Suitable for advanced users how to use the database.

迭代计算一个四阶黎卡提方程-iterative calculation of a four bands Riccati equation

是数据结构书上的算法，都是比较经典的实现。-data structure is the book algorithm, which is a more classic realized.

在班级，年级范围查询成绩，可以增加，删除记录-class, grade scope of inquiry results, can add, delete records

设计一个哈夫曼编码、译码系统。对一个ASCII编码的文本文件中的字符进行哈夫曼编码，生成编码文件；反过来，可将编码文件译码还原为一个文本文件。1.初始化。任意读入一个ASCII编码的文件，统计数据，建立哈夫曼树。2.编码。利用已建立的哈夫曼树给出每个字符的哈夫曼编码。3.图形化输出哈夫曼树中各结点以及哈夫曼编码。4.译码。利用已建立的哈夫曼树对输入文件进行译码并存储为.huf压缩文件。5.反译码。将huf文件译码为ASCII编码的txt文件，与原txt文件进行比较。

Prims算法的程序-Prims algorithm procedures

二叉树算法,如何构造二叉树以及对二叉树的操作-BinaryTree