搜索资源列表
hf
- 哈夫曼树是一种带权路径长度最短的树。 所谓路径长度就是某个端结点到树的根结点的距离,等于该端结点的祖先数,或该结点所在层数减1,用lk表示。-Huffman tree is a weighted length of the shortest path tree. The so-called path length is a client node to the tree root node of the distance, equal to the end of the ancestors of
hf
- 用C语言实现哈夫曼编码，程序清晰，通俗易懂-Using C language Huffman, procedures clear and easily understood
HF
- 数据结构习题---幻方求解 用c++实现N阶幻方的求解-Problem--- data structure with c++ magic square magic squares of order to achieve the solution N
hf
- 实现哈弗曼编码，简单的数据结构算法，算法才是王道！-Coding to achieve Hafu Man
hf
- 实现数据结构中哈弗曼编码译码问题的求解。-data structure haffman code and decode