//霍夫曼树
#include<iostream>
#include<malloc.h>
#include<cstring>
using namespace std;
#define Status int
#define TElemType char
#define OVERFLOW 0
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAX 65535
typedef struct {
unsigned int weight;
unsigned int parent, lchild, rchild;
}HTNode, *HuffmanTree;
typedef char ** HuffmanCode;
select(HuffmanTree HT,int n,int &s)
{
int i,min;
min=MAX;
for(i=1;i<=n;i++)
if(HT[i].parent==0&&min>=HT[i].weight)
{
min=HT[i].weight;
s=i;
}
return OK;
}
void Huffman_Coding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n)
{
//构造哈夫曼树,数组w存放权值,n是叶子数
int i,c,start,f,s1,s2,m;
char *cd;
if(n<1) return;
m=n*2-1;
HT=(HuffmanTree)malloc(sizeof(HTNode)*(m+1));
for(i=1;i<=n;i++)
{
HT[i].weight=w[i];
HT[i].parent=0;
HT[i].lchild=0;
HT[i].rchild=0;
}
for(i=n+1;i<=m;i++)
{
HT[i].weight=0;
HT[i].parent=0;
HT[i].rchild=0;
HT[i].lchild=0;
}
for(i=n+1;i<=m;++i)
{
select(HT,i-1,s1); //在HT[1..i-1]选parent=0的最小权值
HT[s1].parent=i;
select(HT,i-1,s2);
HT[s2].parent=i;
HT[i].weight=HT[s1].weight+HT[s2].weight;
HT[i].lchild=s1;
HT[i].rchild=s2;
}
//求出霍夫曼编码
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()
{
int n=15;
int w[]={0,1192,677,541,518,462,450,242,195,190,181,174,157,138,124,123};
HuffmanTree HT;
HuffmanCode HC;
Huffman_Coding(HT,HC,w,n);
for(int i=1;i<=n;i++)
cout<<HC[i]<<endl;
}
#include<iostream>
#include<malloc.h>
#include<cstring>
using namespace std;
#define Status int
#define TElemType char
#define OVERFLOW 0
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAX 65535
typedef struct {
unsigned int weight;
unsigned int parent, lchild, rchild;
}HTNode, *HuffmanTree;
typedef char ** HuffmanCode;
select(HuffmanTree HT,int n,int &s)
{
int i,min;
min=MAX;
for(i=1;i<=n;i++)
if(HT[i].parent==0&&min>=HT[i].weight)
{
min=HT[i].weight;
s=i;
}
return OK;
}
void Huffman_Coding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n)
{
//构造哈夫曼树,数组w存放权值,n是叶子数
int i,c,start,f,s1,s2,m;
char *cd;
if(n<1) return;
m=n*2-1;
HT=(HuffmanTree)malloc(sizeof(HTNode)*(m+1));
for(i=1;i<=n;i++)
{
HT[i].weight=w[i];
HT[i].parent=0;
HT[i].lchild=0;
HT[i].rchild=0;
}
for(i=n+1;i<=m;i++)
{
HT[i].weight=0;
HT[i].parent=0;
HT[i].rchild=0;
HT[i].lchild=0;
}
for(i=n+1;i<=m;++i)
{
select(HT,i-1,s1); //在HT[1..i-1]选parent=0的最小权值
HT[s1].parent=i;
select(HT,i-1,s2);
HT[s2].parent=i;
HT[i].weight=HT[s1].weight+HT[s2].weight;
HT[i].lchild=s1;
HT[i].rchild=s2;
}
//求出霍夫曼编码
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()
{
int n=15;
int w[]={0,1192,677,541,518,462,450,242,195,190,181,174,157,138,124,123};
HuffmanTree HT;
HuffmanCode HC;
Huffman_Coding(HT,HC,w,n);
for(int i=1;i<=n;i++)
cout<<HC[i]<<endl;
}