霍夫曼算法

HC=(HMC)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)//找到C父结点
if(HT[i].parent==0&&i!=s1)
{
secmin=HT[i].weight;
s2=i;
break;
}
for(i=1;i<=n;i++)
if(HT[i].weight<secmin&&i!=s1&&HT[i].parent==0)//从头到尾权值进行比较，拿到第二个最小的权值结点
if(HT[f].lchild==c) //判断父结点的左孩子是不是 C
cd[--start]='0';//左孩子编码为0
else cd[--start]='1';//右孩子编码为1
HC[i]=(char *)malloc((n-start)*sizeof(char *));
for(p=HT,i=0;i<=n;i++,p++,w++)//叶子结点的权值
{
p->weight=*w;
p->parent=0;
p->lchild=0;
p->rchild=0;
}
for(;i<=m;i++,pp->weight=0;
tempi=i++;
for(;i<=n;i++)
if(HT[i].weight<min&&HT[i].parent==0) //权值进行比较，拿到第一个最小的权值
{
min=HT[i].weight;
s1=i;
}
for(i=tempi;i<=n;i++)//第二结点的下标
unsigned int *w=NULL;
unsigned int i,n;
printf("请输入节点数n:");
scanf("%d",&n);
w=(unsigned int *)malloc((n+1)*sizeof(unsigned int *));
w[0]=0;
printf("请输入权重:\n");
HT[s2].parent=i;//标明它的父结点i
HT[i].lchild=s1;//下标小的放在该根结点的左孩子处
HT[i].rchild=s2;//下标大的放在该根结点的右孩子处
HT[i].weight=HT[s1].weight+HT[s2].weight;//两个权值的小的结点构造的一个根结点的权值
void Error(char *message);
HMC HuffmanCoding(HF HT,HMC HC,unsigned int *w,unsigned int n);
MinCode Select(HF HT,unsigned int n);
void Error(char *message)
#include <stdio.h>
#include <malloc.h>
#include <conio.h>
#include <string.h>
#include <stdlib.h>
#define HuffmanTree HF
#define HuffmanCode HMC
typedef struct
{ unsigned int weight;
unsigned int parent,lchild,rchild;
} HTNode,*HF;
typedef char **HMC;
typedef struct {
unsigned int s1;
unsigned int s2;
} MinCode;
}
printf("HT List:/n");
printf("Number\t\tweight\t\tparent\t\tlchild\t\trchild\n");
for(i=1;i<=m;i++)
printf("%d\t\t%d\t\t%d\t\t%d\t\t%d\n",
i,HT[i].weight,HT[i].parent,HT[i].lchild,HT[i].rchild);
unsigned int i,s1,s2,tempi;
MinCode code;
s1=1;s2=1;
for(i=1;i<=n;i++)
if(HT[i].parent==0)//拿到第一结点的权值
{
min=HT[i].weight;
s1=i;
break;
}
{
fprintf(stderr,"Error:%s/n",message);
exit(1);
}
HMC HuffmanCoding(HF HT,HMC HC,unsigned int *w,unsigned int n)//初始化霍夫树
{
unsigned int i,s1=0,s2=0;
for(i=1;i<=n;i++)
printf("%d\t\t%d\t\t%s\n",i,w[i],HC[i]);
}
MinCode Select(HF HT,unsigned int n)//选择两个结点小的权值的下标
{
unsigned int min,secmin;
unsigned int temp;
strcpy(HC[i],&cd[start]);
}
free(cd);
return HC;
}
void main()
{
MinCode Select(HF HT,unsigned int n);//子函数标识
HF HT=NULL;
HuffmanCode HC=NULL;
for(i=1;i<=n;i++)
{
printf("w[%d]=",i);
scanf("%d",&w[i]);
}
HC=HuffmanCoding(HT,HC,w,n);
printf("HMC:\n");
printf("Number\t\tWeight\t\tCode\n");
HF p;
char *cd;
unsigned int f,c,start,m;
MinCode min;
if(n<=1) Error("Code too small!");
m=2*n-1;//构造霍夫曼树的结点
HT=(HF)malloc((m+1)*sizeof(HTNode));
{
secmin=HT[i].weight;
s2=i;
}
if(s1>s2)
{
temp=s1;
s1=s2;
s2=temp;
}
code.s1=s1;
code.s2=s2;
return code;
}
p->parent=0;
p->lchild=0;
p->rchild=0;
}
for(i=n+1;i<=m;i++)
{
min=Select(HT,i-1);
s1=min.s1;
s2=min.s2;
HT[s1].parent=i;//小标小的结点，标明它的父结点i