哈夫曼编码与译码

{
min2=t[j].weight;
*p2=j;
}
}
}
void crபைடு நூலகம்athfmt(hfmt t)
fclose(p);
n=i;
printf("\nn=%d",n);
for(i=0;i<2*n-1;i++)
{
t[i].lchild=-1;
t[i].rchild=-1;
#include <string.h>
#define MAXLEN 10
typedef struct
{
int weight;
int lchild;
int rchild;
int parent;
char key;
char mima[100];
q->front=q->rear=0;
return q;
}
void inithfmt(hfmt t)
{
int i,j,k;
FILE *p;
char ch;
i=0;
p=fopen("1.txt","r");
}
else
{
printf("1");
}
}
void huffmannode(hfmt t)
{
int i,j,a;
}htnode;
typedef htnode hfmt[MAXLEN];
int n=0;
typedef char elemtype;
typedef struct
{
elemtype data[MAXLEN];
int front,rear;
}seqqueue;
t[p2].parent=i;
t[i].lchild=p1;
t[i].rchild=p2;
t[i].weight=t[p1].weight+t[p2].weight;
}
int j;
for(j=0;j<=i;j++)
{
if(t[j].parent==-1)
if(min1>t[j].weight)
{
min1=t[j].weight;
void enqueue(seqqueue *q,char item)
{
q->data[q->rear]=item;
q->rear=q->rear+1;
}
elemtype dequeue(seqqueue *q)
{
elemtype item;
if(q->rear!=q->front)
i=j;
hfnode2(t,q,i,j);
}
if(t[b].lchild==a)
{
item='0';
enqueue(q,item);
{
printf("\n");
printf("%d\t%d\t%d\t%d\t%c\t%s",t[i].weight,t[i].parent,t[i].lchild,t[i].rchild,t[i].key);
printf("the code is:");
for(i=0;i<n;i++)
{
j=0;
printf("\n");
printf("%c(%d):",t[i].key,t[i].weight);
if(fopen("1.txt","r")==NULL)
printf("open error.");
while((ch=fgetc(p))!=EOF)
{
for(k=0;k<i;k++)
{
}
else
{
item='1';
enqueue(q,item);
}
}
void decoding(hfmt t,seqqueue *q)
hfnode1(t,i,j);
}
}
void Encoding(hfmt t)
{
char r[1000],ch;
int i=0,j;
FILE *p;
p=fopen("2.txt","r");
if(fopen("2.txt","r")==NULL)
t[i].key=ch;
t[i].weight++;
i++;
}
else
t[k].weight++;
}
if(t[j].parent!=-1)
{
i=j;
hfnode1(t,i,j);
}
if(t[b].lchild==a)
{
printf("0");
}
void printhfmt(hfmt t)
{
int i;
printf("\nthe hfmt is:\n");
printf("weight\tparent\tlchild\trchild\tkey\t");
for(i=0;i<2*n-1;i++)
*p1=j;
}
}
for(j=0;j<=i;j++)
{
if(t[j].parent==-1)
if(min2>t[j].weight && j!=(*p1))
{
int i,p1,p2;
inithfmt(t);
for(i=n;i<2*n-1;i++)
{
selectmin(t,i-1,&p1,&p2);
t[p1].parent=i;
t[i].parent=-1;
}
}
void selectmin(hfmt t,int i,int *p1,int *p2)
{
long min1=999999;
long min2=999999;
while((ch=fgetc(p))!=EOF)
{
r[i++]=ch;
}
fclose(p);
len=strlen(r);
for(i=0;i<n;i++)
{
hfnode2(t,q,i,j);
for(j=0;j<n;j++)
t[i].mima[j]=dequeue(q);
{
item=q->data[q->front];
q->front=q->front+1;
return item;
}
}
seqqueue *initqueue(seqqueue *q)
{
q=(seqqueue *)malloc(sizeof(seqqueue));
}
void hfnode2(hfmt t,seqqueue *q,int i,int j)
{
int a,b,c=0;
char item;
a=i;
b=j=t[i].parent;
if(t[j].parent!=-1)
{
{
char r[100],ch;
FILE *p;
int i=0,j=0,len,x,y,s=0;
x=2*n-2;
p=fopen("3.txt","r");
if(fopen("3.txt","r")==NULL)
printf("\nopen error.");
if(t[k].key==ch)
break;
}
if(k==i)
{
t[i].weight=0;
(1)输入一组字符集的大小、字符及权值，建立哈夫曼树，显示该哈夫曼树，并给出每个字符的哈夫曼编码
(2)给出一串字符，按照已建立的哈夫曼树进行编码，显示结果或存入文件
(3)用(2)的结果，按照哈夫曼树进行译码
#include <stdio.h>
#include <stdlib.h>
for(j=0;r[j]!='\0';j++)
for(i=0;i<n;i++)
if(r[j]==t[i].key)
{
hfnode1(t,i,j);
}
printf("\n\nopen error.");
while((ch=fgetc(p))!=EOF)
{
r[i++]=ch;
}
fclose(p);
printf("\n\nth Encoding is:");
}
printf("\n\n");
}