急！求教！怎样用 C 实现哈夫曼编译程序？

给你以前的参考吧,希望有用.

#include
#include
#include
#include
#include

typedef struct {
unsigned int weight;
unsigned int parent,lchild,rchild;
} HTNode,*HuffmanTree;

typedef char **HuffmanCode;

typedef struct {
unsigned int s1;
unsigned int s2;
} MinCode;

void Error(char *message);
HuffmanCode HuffmanCoding(HuffmanTree HT,HuffmanCode HC,unsigned int *w,unsigned int n);
MinCode Select(HuffmanTree HT,unsigned int n);

void Error(char *message)
{
fprintf(stderr,"Error:%s\n",message);
exit(1);
}

HuffmanCode HuffmanCoding(HuffmanTree HT,HuffmanCode HC,unsigned int *w,unsigned int n)
{
unsigned int i,s1=0,s2=0;
HuffmanTree p;
char *cd;
unsigned int f,c,start,m;
MinCode min;
if(n<=1) Error("Code too small!");
m=2*n-1;
HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));
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++,p++)
{
p->weight=0;
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;
HT[s2].parent=i;
HT[i].lchild=s1;
HT[i].rchild=s2;
HT[i].weight=HT[s1].weight+HT[s2].weight;
}
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);
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);
return HC;
}

MinCode Select(HuffmanTree HT,unsigned int n)
{
unsigned int min,secmin;
unsigned int temp;
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;
}
tempi=i++;
for(;i<=n;i++)
if(HT[i].weight {
min=HT[i].weight;
s1=i;
}
for(i=tempi;i<=n;i++)
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=HT[i].weight;
s2=i;
}
if(s1>s2)
{
temp=s1;
s1=s2;
s2=temp;
}
code.s1=s1;
code.s2=s2;
return code;
}

void main()
{
HuffmanTree HT=NULL;
HuffmanCode HC=NULL;
unsigned int *w=NULL;
unsigned int i,n;
printf("Input n:\n");
scanf("%d",&n);
w=(unsigned int *)malloc((n+1)*sizeof(unsigned int *));
w[0]=0;
printf("Enter weight:\n");
for(i=1;i<=n;i++)
{
printf("w[%d]=",i);
scanf("%d",&w[i]);
}
HC=HuffmanCoding(HT,HC,w,n);
printf("HuffmanCode:\n");
printf("Number\t\tWeight\t\tCode\n");
for(i=1;i<=n;i++)
printf("%d\t\t%d\t\t%s\n",i,w[i],HC[i]);

}

看看是否满意
#include
#include
#define MAX 1000
#define MIN 20000
typedef struct node{
int w;
char data;
int num;
bool visited;
int parents;
}Node;

void Create(Node *m[MAX],int n);//要构造的叶顶点
int Min_Node(Node *m[MAX]);//寻找具有最小权值的顶点
int Count_Visit(Node *m[MAX]);//被访问的顶点数
void CreateHuffman(Node *m[MAX],int n);//创建最优二叉树
void HuffmanCode(Node *m[MAX],int n);//编码

void Create(Node *m[MAX],int n)
{
int i;
Node *p;
printf("**输入顺序为字符和权值**\n");
for(i=0;i p=(Node *)malloc(sizeof(Node));
scanf("%s",&p->data);
scanf("%d",&p->w);
p->visited=0;
p->parents=-1;
m[i]=p;
}
for(;i}

int Min_Node(Node *m[MAX])
{
int min,i,spot;
min=MIN;
for(i=0;i if(m[i]&&m[i]->visited==0&&m[i]->w min=m[i]->w;
spot=i;
}
}
m[spot]->visited=1;
return(spot);
}

int Count_Visit(Node *m[MAX])
{
int num=0,i;
for(i=0;i if(m[i]&&m[i]->visited==0){
num++;
}
}
return(num);
}

void CreateHuffman(Node *m[MAX],int n)
{
int spot1,spot2;
int j;
Node *p;
j=n;
while(Count_Visit(m)>1){
spot1=Min_Node(m);
spot2=Min_Node(m);
p=(Node *)malloc(sizeof(Node));
m[spot1]->num=0;
m[spot2]->num=1;
p->parents=-1;
p->w=m[spot1]->w+m[spot2]->w;
p->visited=0;
m[++j]=p;
m[spot1]->parents=m[spot2]->parents=j;
}
}

void HuffmanCode(Node *m[MAX],int n)
{
int ch[20];
Node *p;
int i,j;
for(i=0;i printf("哈夫曼编码%c:",m[i]->data);
p=m[i];
j=0;
while(p->parents!=-1){
ch[j++]=p->num;
p=m[p->parents];
}
j--;
for(;j>=0;j--){
printf("%d",ch[j]);
}
printf("\n");
}
}

void main()
{
Node *m[MAX];
int n;
printf("叶子数:");
scanf("%d",&n);
Create(m,n);
CreateHuffman(m,n);
HuffmanCode(m,n);
}

以前做过的，我有源程序，编码，译码都有．只要改一下字母频率就可以了
我的邮箱xuzg-1986@163.com
要的话给我发邮件

关注~