huffman

263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)

w_ipp-sample-data-compression，Intel，IPP函数库，文件数据快速压缩解压缩工具包。可以进行数据加密解密告诉处理( W_ipp-sample-data-compression, Intel, IPP library, file compression and decompression tool for fast data packet. You can tell the encryption and decryption of data processing)

哈夫曼编码，基于MFC开发。哈夫曼编码为熵编码中的最佳方法之一，广泛用于各种数据压缩技术中。-Huffman coding, based on the MFC. Huffman coding for entropy coding one of the best ways, for a wide variety of data compression technology.

压缩包中包含了gl.h，glaux.h，glext.h，glui.h，glut.h等头文件以及对应的库文件。还有对应的配置方法。(Compression package contains gl.h, glaux.h, glext.h, glui.h, glut.h Header Files and corresponding library file. There are corresponding configuration.)

这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。(LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it became a category C, it can be to facilitate the compression.)

基于tinyjpeg的jpeg解压缩程序，可解码jpeg数据为YUV分量数据(Based Solutions tinyjpeg jpeg compression program, you can decode jpeg data to YUV component data)

对输入的字符进行哈弗曼编码，生成编码表，计算压缩比等(haffman tree)

说明：  图的算法实现 （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.)

简单易用的制作压缩包软件，原著老毛桃。使用简单，压缩时间快(easy to use for make cab)

用C++的模板类实现的霍夫曼树及其编码过程，可视地展示霍夫曼树的结构。(Huffman tree and its encoding process to achieve C++ template class, visual display of the structure of the Huffman tree.)