Huffman algorithm we use to establish a Huffman tree (the optimal binary tree), while the frequency of the data as the weights assigned to Huffman tree nodes.
我们利用哈夫曼算法建立一棵哈夫曼树(最优二叉树)，同时将数据出现的频率作为权值赋给哈夫曼树中的结点。
The paper discusses a nonregular cost function and its optimum criterion, presenting an algorithm of constructing and optimal alphabetic binary tree under this criterion.
本文讨论一种非正则的评价函数和它的最优化的一种准则，给出在这种准则下构造按字典次序的最优二元树的一种算法。
应用推荐