哈夫曼编码算法的仿真和比较.rar

  • keepnature
    了解作者
  • Others
    开发工具
  • 247KB
    文件大小
  • rar
    文件格式
  • 0
    收藏次数
  • 10 积分
    下载积分
  • 0
    下载次数
  • 2021-02-24 19:24
    上传日期
哈夫曼树(Huffman Tree)也是一种特殊的二叉树,这种树的所有叶子结点都带有权值,从中构造出带权路径长度最短的二叉树,即哈夫曼树。
哈夫曼编码算法的仿真和比较.rar
  • 哈夫曼编码算法的仿真和比较.docx
    296KB
内容介绍
<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/6265d2e14c65f412591966bd/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/6265d2e14c65f412591966bd/bg1.jpg"><div class="c x0 y1 w2 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0">&#21704;&#22827;&#26364;&#32534;&#30721;&#31639;&#27861;&#30340;&#20223;&#30495;&#21644;&#27604;&#36739;</div><div class="t m0 x2 h3 y3 ff1 fs0 fc0 sc0 ls0 ws0">&#21704;&#22827;&#26364;&#26641;</div><div class="t m0 x2 h4 y4 ff1 fs1 fc0 sc1 ls0 ws0">&#21704;&#22827;&#26364;&#26641;&#65288;<span class="ff2">Hu&#58883;man Tree</span>&#65289;&#20063;&#26159;&#19968;&#31181;&#29305;&#27530;&#30340;&#20108;&#21449;&#26641;&#65292;&#36825;&#31181;&#26641;&#30340;&#25152;&#26377;&#21494;&#23376;&#32467;&#28857;&#37117;&#24102;&#26377;&#26435;&#20540;&#65292;&#20174;&#20013;&#26500;&#36896;</div><div class="t m0 x2 h4 y5 ff1 fs1 fc0 sc1 ls0 ws0">&#20986;&#24102;&#26435;&#36335;&#24452;&#38271;&#24230;&#26368;&#30701;&#30340;&#20108;&#21449;&#26641;&#65292;&#21363;&#21704;&#22827;&#26364;&#26641;&#12290;</div><div class="t m0 x2 h5 y6 ff1 fs2 fc0 sc0 ls0 ws0">&#21704;&#22827;&#26364;&#26641;&#30340;&#23450;&#20041;</div><div class="t m0 x2 h6 y7 ff3 fs3 fc0 sc1 ls0 ws0"> <span class="ff1">&#35774;&#20108;&#21449;&#26641;&#20855;&#26377;<span class="_ _0"> </span></span>n<span class="_"> </span><span class="ff1">&#20010;&#24102;&#26435;&#20540;&#30340;&#21494;&#23376;&#32467;&#28857;</span>,<span class="_ _1"></span><span class="ff1">&#37027;&#20040;&#20174;&#26681;&#32467;&#28857;&#21040;&#21508;&#20010;&#21494;&#23376;&#32467;&#28857;&#30340;&#36335;&#24452;&#38271;&#24230;&#19982;</span></div><div class="t m0 x2 h6 y8 ff1 fs3 fc0 sc1 ls0 ws0">&#30456;&#24212;&#32467;&#28857;&#26435;&#20540;&#30340;&#20056;&#31215;&#30340;&#21644;<span class="ff3">,</span>&#21483;&#20570;&#20108;&#21449;&#26641;&#30340;&#24102;&#26435;&#36335;&#24452;&#38271;&#24230;<span class="ff3">,</span>&#35760;&#20316;<span class="ff3">:</span></div></div><div class="c x3 y9 w3 h7"><div class="t m0 x0 h8 ya ff4 fs4 fc0 sc1 ls0 ws0">WPL<span class="ff5">=</span></div><div class="t m0 x4 h9 yb ff5 fs5 fc0 sc1 ls0 ws0">&#8721;</div><div class="t m0 x5 ha yc ff4 fs6 fc0 sc1 ls0 ws0">i<span class="_ _2"> </span><span class="ff5">=<span class="_ _1"></span><span class="ff6">1</span></span></div><div class="t m0 x6 hb yd ff4 fs6 fc0 sc1 ls0 ws0">n</div><div class="t m0 x7 hc ya ff4 fs4 fc0 sc1 ls0 ws0">w</div><div class="t m0 x8 hb ye ff4 fs6 fc0 sc1 ls0 ws0">i</div><div class="t m0 x9 hc ya ff4 fs4 fc0 sc1 ls0 ws0">&#215;<span class="_ _2"></span>l</div><div class="t m0 xa hb ye ff4 fs6 fc0 sc1 ls0 ws0">i</div></div><div class="c x0 y1 w2 h2"><div class="t m0 x2 h6 yf ff1 fs3 fc0 sc1 ls0 ws0">&#20854;&#20013;<span class="ff3">,</span>&#20026;&#31532;<span class="_ _0"> </span><span class="ff3">i<span class="_ _0"> </span></span>&#20010;&#21494;&#23376;&#32467;&#28857;&#30340;&#26435;&#20540;<span class="ff3">,l<span class="_ _0"> </span></span>&#20026;&#31532;<span class="_ _0"> </span><span class="ff3">i<span class="_ _0"> </span></span>&#20010;&#21494;&#23376;&#32467;&#28857;&#30340;&#36335;&#24452;&#38271;&#24230;&#12290;&#22914;&#22270;<span class="_ _3"> </span><span class="ff3">6.19<span class="_"> </span></span>&#25152;&#31034;&#30340;&#20108;</div><div class="t m0 x2 h6 y10 ff1 fs3 fc0 sc1 ls0 ws0">&#21449;&#26641;<span class="ff3">, </span>&#23427;&#30340;&#24102;&#26435;&#36335;&#24452;&#38271;&#24230;&#20540;<span class="_ _3"> </span><span class="ff3">W<span class="_ _4"></span>PL=1&#215;3+3&#215;3+2&#215;2+4&#215;1=2<span class="_ _1"></span>0 </span></div><div class="t m0 x2 h6 y11 ff1 fs3 fc0 sc1 ls0 ws0">&#22914;&#26524;&#32473;&#23450;&#19968;&#32452;&#20855;&#26377;&#30830;&#23450;&#26435;&#20540;&#30340;&#21494;&#23376;&#32467;&#28857;<span class="ff3">&#183; </span>&#21487;&#20197;&#26500;&#36896;&#20986;&#19981;&#21516;&#30340;&#24102;&#26435;&#20108;&#21449;&#26641;&#65292; &#23427;&#20204;&#30340;&#24102;</div><div class="t m0 x2 h6 y12 ff1 fs3 fc0 sc1 ls0 ws0">&#26435;&#36335;&#24452;&#38271;&#24230;&#24182;&#19981;&#30456;&#21516;<span class="ff3">&#183; </span>&#25105;&#20204;&#25226;&#20854;&#20013;&#20855;&#26377;&#26368;&#23567;&#24102;&#26435;&#36335;&#24452;&#38271;&#24230;&#30340;&#20108;&#21449;&#26641;&#31216;&#20026;&#21704;&#22827;&#26364;&#26641;<span class="ff3">&#183;.</span></div></div></div><div class="pi" data-data='{"ctm":[1.568627,0.000000,0.000000,1.568627,0.000000,0.000000]}'></div></div> </body> </html>
评论
    相关推荐
    • 哈夫曼 香农
      哈弗曼编码,香农编码,是信息安全的实验报告,和数据结构的实验项目
    • 哈夫曼编码
      C语言数据结构,经典的哈夫曼树与哈夫曼编码的实现。
    • 哈夫曼编码
      Java中使用特定方法实现哈夫曼编码,并且对一句话进行编码和译码。
    • 哈夫曼算法
      使用哈夫曼算法对字符进行排序,通过字符出现的权值求出哈夫曼树,并给出哈夫曼编码
    • 哈夫曼压缩
      这个是用Qt写的哈夫曼压缩,界面用的都是qt类库里的东西,压缩程序是之前自己写的,直接移植过来,都是C++
    • 哈夫曼压缩
      NULL 博文链接:https://dysfzhoulong.iteye.com/blog/833479
    • 哈夫曼树.zip
      可以实现哈夫曼树编码,达到节省空间的目的
    • 哈夫曼.zip
      哈夫曼编码,打开复制粘贴即可使用,以c语言为基础编制
    • 哈夫曼.zip
      实现哈夫曼树的构建,遍历,编码等哈夫曼树的具体操作
    • 哈夫曼.rar
      了解哈夫曼编码的思想,掌握哈夫曼编码的实现。了解优先队列的使用。