当前位置:七道奇文章资讯编程技术VC/C++编程
日期:2011-03-22 13:55:00  来源:本站整理

<b>霍夫曼树编码的实现</b>[VC/C++编程]

赞助商链接



  本文“<b>霍夫曼树编码的实现</b>[VC/C++编程]”是由七道奇为您精心收集,来源于网络转载,文章版权归文章作者所有,本站不对其观点以及内容做任何评价,请读者自行判断,以下是其具体内容:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <conio.h>
typedef struct
{
   unsigned int Weight;
   unsigned int Parent;
   unsigned int lChild;
   unsigned int rChild;
}HTNode,*HuffmanTree;
typedef char **HuffmanCode;
int LookFor(char *str,char letter,int count);
void OutputWeight(char *Data,int Length,
          char **WhatLetter,
          int **Weight,int *Count);
void HuffmanCoding(HuffmanTree *HT,
           HuffmanCode *HC,
           int *Weight,
           int Count);
void Select(HuffmanTree HT,int Count,int *s1,int *s2);
int main()
{
   HuffmanTree HT;
   HuffmanCode HC;
   char Data[100];
   char *WhatLetter;
   int *Weight;
   int Count;
   int i;
   printf("Please input the line:");
   /* Example: aaaaaaaaaaaaaabcccccc*/
   scanf("%s",Data);
   printf("\n");
   OutputWeight(Data,strlen(Data),
          &WhatLetter,
          &Weight,
          &Count);
   HuffmanCoding(&HT,&HC,Weight,Count);
   printf(" Letter Weight Code\n");
   for(i=0;i<Count;i++)
   {
     printf(" %c ",WhatLetter[i]);
     printf("%d ",Weight[i]);
     printf("%s\n",HC[i+1]);
   }
   printf("\n");
   getch();
   return 0;
}
void HuffmanCoding(HuffmanTree *HT,
           HuffmanCode *HC,
           int *Weight,
           int Count)
{
   int i;
   int s1,s2;
   int TotalLength;
   HuffmanTree p;
   char* cd;
   unsigned int c;
   unsigned int f;
   int start;
   if(Count<=1) return;
   TotalLength=Count*2-1;
   (*HT)=(HuffmanTree)malloc((TotalLength+1)*sizeof(HTNode));
   p=((*HT)++);
   for(i=1;i<=Count;i++)
   {
     (*HT)[i].Parent=0;
     (*HT)[i].rChild=0;
     (*HT)[i].lChild=0;
     (*HT)[i].Weight=(*Weight);
     Weight++;
   }
   for(i=Count+1;i<=TotalLength;i++)
   {
     (*HT)[i].Weight=0;
     (*HT)[i].Parent=0;
     (*HT)[i].lChild=0;
     (*HT)[i].rChild=0;
   }
   /*///////////////////Create HuffmanTree////////////////*/
   for(i=Count+1;i<=TotalLength;++i)
   {
     Select((*HT),i-1,&s1,&s2);
     (*HT)[s1].Parent=i;
     (*HT)[s2].Parent=i;
     (*HT)[i].lChild=s1;
     (*HT)[i].rChild=s2;
     (*HT)[i].Weight=(*HT)[s1].Weight+(*HT)[s2].Weight;
   }
   /*///////////////////Output Huffman Code///////////////*/
   (*HC)=(HuffmanCode)malloc((Count+1)*sizeof(char*));
   cd=(char*)malloc(Count*sizeof(char));
   cd[Count-1]='\0';
   for(i=1;i<=Count;++i)
   {
     start=Count-1;
     for(c=i,f=(*HT)[i].Parent;f!=0;c=f,f=(*HT)[f].Parent)
     {
       if((*HT)[f].lChild==c)
         cd[--start]='0';
       else
         cd[--start]='1';
       (*HC)[i]=(char*)malloc((Count-start)*sizeof(char));
       strcpy((*HC)[i],&cd[start]);
     }
   }
}
void Select(HuffmanTree HT,int Count,int *s1,int *s2)
/*/(*s1) is smallest,(*s2) is smaller.*/
{
   int i;
   unsigned int temp1=0;
   unsigned int temp2=0;
   unsigned int temp3;
   for(i=1;i<=Count;i++)
   {
     if(HT[i].Parent==0)
     {
       if(temp1==0)
       {
         temp1=HT[i].Weight;
         (*s1)=i;
       }
       else
       {
         if(temp2==0)
         {
           temp2=HT[i].Weight;
           (*s2)=i;
           if(temp2<temp1)
           {
             temp3=temp2;
             temp2=temp1;
             temp1=temp3;
             temp3=(*s2);
             (*s2)=(*s1);
             (*s1)=temp3;
           }
         }
         else
         {
           if(HT[i].Weight<temp1)
           {
             temp2=temp1;
             temp1=HT[i].Weight;
             (*s2)=(*s1);
             (*s1)=i;
           }
           if(HT[i].Weight>temp1&&HT[i].Weight<temp2)
           {
             temp2=HT[i].Weight;
             (*s2)=i;
           }
         }
       }
     }
   }
}
int LookFor(char *str,char letter,int count)
{
   int i;
   for(i=0;i<count;i++)
   {
     if(str[i]==letter) return i;
   }
   return -1;
}
void OutputWeight(char *Data,int Length,
          char **WhatLetter,
          int **Weight,int *Count)
{
   int i;
   char* Letter=(char*)malloc(Length);
   int* LetterCount=(int *)malloc(Length);
   int AllCount=0;
   int Index;
   int Sum=0;
   float Persent=0;
   for(i=0;i<Length;i++)
   {
     if(i==0)
     {
       Letter[0]=Data[i];
       LetterCount[0]=1;
       AllCount++;
     }
     else
     {
       Index=LookFor(Letter,Data[i],AllCount);
       if(Index==-1)
       {
         Letter[AllCount]=Data[i];
         LetterCount[AllCount]=1;
         AllCount++;
       }
       else
       {
         LetterCount[Index]++;
       }
     }
   }
   for(i=0;i<AllCount;i++)
   {
     Sum=Sum+LetterCount[i];
   }
   (*Weight)=(int*)malloc(AllCount);
   (*WhatLetter)=(char*)malloc(AllCount);
   for(i=0;i<AllCount;i++)
   {
     Persent=(float)LetterCount[i]/(float)Sum;
     (*Weight)[i]=(int)(1000*Persent);
     (*WhatLetter)[i]=Letter[i];
   }
   (*Count)=AllCount;
}


  以上是“<b>霍夫曼树编码的实现</b>[VC/C++编程]”的内容,如果你对以上该文章内容感兴趣,你可以看看七道奇为您推荐以下文章:
  • <b>hosts是什么 hosts文件在什么位置 若何改正hosts</b>
  • <b>在 Windows 8 中手动安装语言包</b>
  • <b>五个常见 PHP数据库问题</b>
  • Windows中Alt键的12个高效快速的利用本领介绍
  • <b>MySQL ORDER BY 的实现解析</b>
  • <b>详解MySQL存储历程参数有三种范例(in、out、inout)</b>
  • <b>Win8系统恢复出来经典的开始菜单的办法</b>
  • <b>Win8系统花屏怎么办 Win8系统花屏的办理办法</b>
  • <b>Windows 7系统下无线网卡安装</b>
  • <b>为什么 Linux不需求碎片整理</b>
  • <b>Windows 8中删除账户的几种办法(图)</b>
  • <b>教你如安在win7下配置路由器</b>
  • 本文地址: 与您的QQ/BBS好友分享!
    • 好的评价 如果您觉得此文章好,就请您
        0%(0)
    • 差的评价 如果您觉得此文章差,就请您
        0%(0)

    文章评论评论内容只代表网友观点,与本站立场无关!

       评论摘要(共 0 条,得分 0 分,平均 0 分) 查看完整评论
    Copyright © 2020-2022 www.xiamiku.com. All Rights Reserved .