haffman

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

不可压缩稳态滑块润滑，一定长度的变间隙油膜厚度解析(Incompressible variable gap steady slide lubrication film thickness resolve certain length)

这是一个基于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.)

说明：  文件介绍了x264程序的算法流程表，每个函数的内容详细介绍在里面 (Document describes the algorithm flow chart x264 programs, and detailed description of each function in it)

RLE是一个压缩的算法，里面有算法的C++程序实现。(RLE is a compression algorithm, there are algorithms C++ program)

利用C++实现的插入,删除,增加接点等功能(The use of C++ Realized insert, delete, increase the contact and other functions)

动态规划中图形算法中的最短路径算法 用类做的，分几个函数(The short road of dymta i don t know what is this program means，it is a c++ program ！numeric recipes in C++ )

Docuemtns,Hot Documents

一个可以简单的压缩小程序，是利用游程编码原理(One can simply compress small program is the use of run-length coding theory)

哈夫曼编码译码系统，设置发送者和接受者两个功能， 发送者的功能包括： ①输入待传送的字符信息； ②统计字符信息中出现的字符种类数和各字符出现的次数（频率）； ②根据字符的种类数和各自出现的次数建立哈夫曼树； ③利用以上哈夫曼树求出各字符的哈夫曼编码； ④将字符信息转换成对应的编码信息进行传送。 接受者的功能包括： ①接收发送者传送来的编码信息； ②利用上述哈夫曼树对编码信息进行翻译，即将编码信息还原成发送前的字符信息。 (Huffman decoding system, set the sender and the recipient of two functions, the sender' s features include: (1) input to be transmitted character information ② statistical character information, the number of types of characters and characters the number of occurrences (frequency create a Huffman tree) ② According to the number of types of characters and their respective number of occurrences ③ use the Huffman tree to find the characters Huffman coding ④ character information into the corresponding coding information for delivery. The recipient of the features include: (1) to receive the coded information to the sender transmission ② above Huffman tree coded information to be translated, is about to coded information to restore the character information before sending.)