哈夫曼算法及其应用



给定n个权值作为n个叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树。哈夫曼编码是一种根据哈夫曼树对文件进行编码的方式。哈夫曼编码是可变字长编码的一种。本次课程设计是对一个已建文本文件，统计该文件中各字符频率，对各字符进行Huffman编码，将该文件翻译成Huffman编码文件，再将Huffman编码文件翻译成原文件。压缩文件即读文件，统计文件中的字符个数，对文件进行哈夫曼编码和译码，并将编码译码后的字符存储在文件中。-Huffman algorithm and its application



　　 Given the right value of n as n-leaf node, construct a binary tree, if the weighted path length to a minimum, that such a binary tree for the optimal binary tree, also called Huffman tree. Huffman coding is a tree of files based on Huffman coding. Huffman coding is a variable word length coding. The course design has been built is a text file, the file statistics in the frequency of each character, the character of the Huffman coding, Huffman coding the translation of documents into the file, and then Huffman coding translation of documents into the original file. Compressed file that is read documents, statistics the number of characters in the file, the file Huffman encoding and decoding and encoding decoded characters are stored in files.