Description: Huffman coding using optimal prefix code of the greedy algorithm constructs huffman tree: First, scan the input file, the characters appear as well as statistics the number of occurrences of each character. Take the minimum number of occurrences for each two nodes (node) into a single node (node), and the total value added as the cumulative number of new contacts, the top is the root node (root)
To Search:
File list (Check if you may need any files):
SA10225361李长刚_第六次实验\huffmantree\huffman.c
...........................\...........\huffman.h
...........................\...........\output.txt
...........................\...........\test.txt
...........................\SA10225361李长刚_第六次实验.doc
...........................\huffmantree
SA10225361李长刚_第六次实验
Download