数据结构第六章实验

#include

#include

#include

typedef struct{

unsigned int weight;

unsigned int parent,lchild,rchild;

}HTNode,*HuffmanTree;

typedef char * *HuffmanCode;

/*void Select(HuffmanTree &HT,int n,int &s1,int &s2) {

s1=1;int j;

for(j=1;j<=n;j++)

{

while(HT[j].parent==0)

{

if(HT[s1].weight>HT[j].weight)

s1=j;

}

}

HT[s1].parent=1;

if(s1!=1)s2=1;else s2=2;

for( j=1;j<=n;j++)

{

while(HT[j].parent==0)

{

if(HT[s2].weight>HT[j].weight)

s2=j;

}

}

}错误，未查出原因*/

int min(HuffmanTree t,int i)

{

int j,flag;

unsigned int k;

for(j=1;j<=i;j++)

if(t[j].weight

k=t[j].weight,flag=j;

t[flag].parent=1;

return flag;

}

void Select(HuffmanTree t,int i,int &s1,int &s2)

{ // s1为最小的两个值中序号小的那个

int j;

s1=min(t,i);

s2=min(t,i);

if(s1>s2)

{

j=s1;

s1=s2;

s2=j;

}

}

void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n){ int m,i,start,t1,t2;

unsigned int c,f;

char *cd;

if(n<=1){cout<<"Error!"<

m=2*n-1;

HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));

for(i=1;i<=n;i++)

{

HT[i].weight=w[i-1];

HT[i].parent=0;

HT[i].lchild=0;

HT[i].rchild=0;

}

for(;i<=m;i++)

HT[i].parent=0;

for(i=n+1;i<=m;++i)

{

Select(HT,i-1,t1,t2);

HT[t1].parent=i;HT[t2].parent=i;

HT[i].lchild=t1;HT[i].rchild=t2;

HT[i].weight=HT[t1].weight+HT[t2].weight;

}

HC=(HuffmanCode)malloc((n+1)*sizeof(char *));

cd=(char *)malloc(n*sizeof(char));

cd[n-1]='\0';

for(i=1;i<=n;++i)

{

start=n-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((n-start)*sizeof(char));

strcpy(HC[i],&cd[start]);

}

free(cd);

}

void main()

{

HuffmanTree HT;

HuffmanCode HC;

int i,n,*w;

cout<<"请输入赫夫曼的字符个数:"<

cin>>n;

w=(int *)malloc(n*sizeof(int));

cout<<"请输入赫夫曼字符权值："<

for(i=0;i

{

cin>>*(w+i);

}

cout<<"执行赫夫曼树和赫夫曼编码"<

HuffmanCoding(HT,HC,w,n);

cout<<"输出赫夫曼树储存数据："<

for(i=1;i<=2*n-1;i++)

{

cout<

}

cout<<"输出赫夫曼编码"<

for(i=1;i<=n;i++)

{

cout<

}

}