haffman

哈夫曼编码译码系统，设置发送者和接受者两个功能， 发送者的功能包括： ①输入待传送的字符信息； ②统计字符信息中出现的字符种类数和各字符出现的次数（频率）； ②根据字符的种类数和各自出现的次数建立哈夫曼树； ③利用以上哈夫曼树求出各字符的哈夫曼编码； ④将字符信息转换成对应的编码信息进行传送。 接受者的功能包括： ①接收发送者传送来的编码信息； ②利用上述哈夫曼树对编码信息进行翻译，即将编码信息还原成发送前的字符信息。 (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.)

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

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

利用零树小波的概念，完成了对静态图像的编码与解码，经过调试的。(The use of the concept of zerotree wavelet completed on the static image encoding and decoding, after debugging.)

利用Huffman编码方式对一段文字进行编码和解码。哈夫曼编码是可变字长编码(VLC)的一种。(Using the Huffman encoding method for encoding and decoding of a paragraph of text. Huffman code is a variable length coding (VLC) is a kind of.)

加密、压缩(The Examples of Encrypt and Compression)

Jepg2000的压缩解压(Jepg2000 compression decompression)

说明：  用单片机来直接驱动步进电机很精确走小步子.(Using single-chip to directly drive stepper motor is very accurate take small steps.)

newmark-b法的简要程序，供大家使用(newmark-b)

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