PRIM

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

纯C语言写的小型通用数据库，一个C数据结构组科技小组的作品，附有开发思路PPT，这可是一个宝贵的资源哦，更底层的东西，运行于DOS提示符，可以新建数据库等操作。C的编程高手们值得参考一下。 (Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)

用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

约瑟夫问题，通过C语言对约瑟夫问题进行了分析和讲解，从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)

这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)

棋盘覆盖，算法分析，很有用的东西，大家一起来分享一下(Board covers, algorithm analysis, useful things, we share together)

参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)

说明：  数据结构：Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)

简单LR语法分析程序自动生成器的实现，可用作数据结构课程设计(LR (0) grammar analysis)