tttt

说明：  一个简单的32位位图压缩算法，基本思想是，扫描像素点，后面有雷同的就记下重复次数。(A simple 32-bit bitmap compression algorithm, the basic idea is to scan pixel, behind identical repetitions on the record.)

zip压缩源代码，附有整个工程，保证能用，可应用于文件压缩，内存压缩(zip compressed source code, with the whole project, and ensure that use, can be applied to file compression, memory compression)

基于哈弗曼树的压缩软件，可压缩文字和位图。(Huffman tree based compression software, compressible text and bitmaps.)

这里给出的源代码huffman.zip用8种不同的方式实现了Huffman编码算法。这些代码意在演示不同Huffman算法的实现原理，比较算法执行效率的差别，但并没有针对实际应用环境的需求，做更多的空空空间或效率优化。全部代码以C++语言开发，为了更容易地实现各种数据结构，代码中大量应用了标准C++库与模板技术。——总之，这些代码的作用在于示例与演示；如果大家想把这些代码应用在实际应用中，可能还需要 (The given here source code huffman.zip eight different ways to achieve the Huffman coding algorithm. These codes are intended to demonstrate different Huffman algorithm implementation principle, the difference of the algorithm execution efficiency, but does not demand for practical application environment, do more empty space or efficiency optimization. The entire code C++ language development code in order to make it easier to achieve a variety of data structures, a large number of applications the standard C++ library template.- In short, these code examples and demonstration If we want the code used in practical applications may also need)

说明：  图的算法实现 （1）将图的信息建立文件； （2）从文件读入图的信息，建立邻接矩阵和邻接表； （3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。 (Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.)

ezw程序，主要对图像进行小波变换，然后基于ezw算法进行编码(EZW process, mainly on the image wavelet transform, and then based on the EZW coding algorithm)

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)

霍夫曼编码的C++实现，含word详细叙述文档，详细注释。(Huffman coding C++ to achieve, including the word detailed description of the documents, detailed notes.)

JPEG里MQ算术编码测试程序 编解码器 C(MQ arithmetic coding in JPEG test procedure codec C)

使用哈弗曼算法，对文件进行压缩然后再进行解压。(Use the Huffman algorithm to compress the file and then decompress.)