请输入您要查询的字词:

 

单词 MinimumWeightedPathLength
释义

minimum weighted path length


Given a list of weights, W:={w1,w2,,wn}, theminimum weighted path length is the minimum of the weighted path length of all extended binary treesMathworldPlanetmath that have n external nodes with weights taken from W. There may be multiple possible trees that give this minimum path length, and quite often finding this tree is more important than determining the path length.

Example

Let W:={1,2,3,3,4}. The minimum weighted path length is29. A tree that gives this weighted path length is shown below.

Applications

Constructing a tree of minimum weighted path length for a given set of weights has several applications, particularly dealing with optimization problems.A simple and elegant algorithmMathworldPlanetmath for constructing such a tree is Huffman’s algorithm.Such a tree can give the most optimal algorithm for merging n sorted sequences (optimal merge). It can also provide a means of compressing data (Huffman codingMathworldPlanetmath), as well as lead to optimal searches.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/6/18 9:20:11