搜索资源列表
minimumtree
- 利用克鲁斯卡尔算法计算最小生成树,以文本形式输出生成树中各条边以及他们的权值。-Using Kruskal minimum spanning tree algorithm to output text in the spanning tree edges and their weights.
asd
- 赫夫曼编码，实现压缩编码，字符码长 察看权值-Huffman coding to achieve compression, the character code value of a long look at the right
huffman
- 构造哈夫曼树的程序 根据权值构造哈夫曼树存放于ht数组，函数wpl用来计算哈夫曼树的解劝路径长度WPL-to build the huffman
huffman
- 有关于huffman函数,打开一个文档并读取本件的英文单词来实现权值的编码.-There are about huffman function