/*
*哈夫曼編碼-鏈式結構
*
*功能實現:
* 源文件字符權值確認操作
* 哈夫曼樹的建立操作
* 字符字典的建立操作
* 源文件轉碼操作操作
* 二進制文件譯碼操作
* 文件輸出操作
* 內存清理操作
*/
#include <stdio.h>
#include <stdlib.h>
#define _HFMAlgorithm_
#define codesize 30
//哈夫曼樹結點定義
typedef struct forest{
struct forest *left;
struct forest *right;
struct forest *parent;
unsigned int weight;
char word;
}HFMNode;
//字符字典結點定義
typedef struct hfmtable{
char word;
char code[codesize];
int start;//標記起始位置
struct hfmtable *next;
}Table;
//函數聲明
HFMNode * ReadFile(void);
HFMNode * CreateHFMTree(HFMNode *F);
void HFMCode(HFMNode * root,Table * &table);
void PrintHFMTree(HFMNode *root);
void PrintTable(Table *t);
void TransCoding(Table * table);
void ReTransCoding(HFMNode * root);
void SelectFile(void);
void PrintFileInformation(char FileName[]);
void DestroyHFMTree(HFMNode *root);
void DestroyTable(Table *table);
//讀取源文件,確認各字符權值建立森林
HFMNode * ReadFile(void)
{
HFMNode *head,*p;
FILE *fp = NULL;
char a;
//創建表頭結點
head = (HFMNode *)malloc(sizeof(HFMNode));
head->left = head->right = head->parent = NULL;
head->word = '\0';
head->weight = 0;
//讀取源文件,確認權重
fp = fopen("input.data","r");
while( (a = fgetc(fp)) != EOF ){
for(p = head;p->parent && p->parent->word - a;p = p->parent);
if(!p->parent){//沒找到結點,追加一個新結點
p->parent = (HFMNode *)malloc(sizeof(HFMNode));
p->parent->left = p->parent->right = p->parent->parent = NULL;
p->parent->word = a;
p->parent->weight = 0;
}//end if
p->parent->weight++;
}//end while
fclose(fp);
return head;
}
//根據權值建立哈夫曼樹
HFMNode * CreateHFMTree(HFMNode *F)
{
HFMNode *p,*k1,*k2;//k1,k2爲最小值次小值前驅結點
HFMNode *d1,*d2;//d1,d2爲最小值次小值結點
while(F->parent->parent){
for(k1 = F,p = k2 = F->parent;p->parent;p = p->parent){
//從鏈表森林中找最小值次小值前驅結點
if(p->parent->weight < k1->parent->weight){
k2 = k1;
k1 = p;
}//end if
else if(p->parent->weight < k2->parent->weight){
k2 = p;
}//end if
}//end for
//取出最小值,次小值結點,合併後放回森林
d1 = k1->parent;
d2 = k2->parent;
if(d1->parent == d2){//分情況處理取結點順序
k2->parent = d2->parent;
k1->parent = d1->parent;
}//end if
else{
k1->parent = d1->parent;
k2->parent = d2->parent;
}//end else
//建立一個過渡結點
p = (HFMNode *)malloc(sizeof(HFMNode));
p->left = d1;
p->right = d2;
p->word = '\0';
p->weight = d1->weight + d2->weight;
d1->parent = d2->parent = p;
p->parent = F->parent;
F->parent = p;
}
F->parent->parent = NULL;
p = F->parent;
free(F);
return p;
}
//建立哈夫曼字符字典
void HFMCode(HFMNode * root,Table * &table)
{
Table *p;
HFMNode *q,*r;
if(root){
HFMCode(root->left,table);
HFMCode(root->right,table);
if(root->left == NULL && root->right == NULL){
for(p = table;p && p->word - root->word;p = p->next);
if(!p){//表中尚無該字符的譯碼字典,頭插式添加字典信息
p = (Table *)malloc(sizeof(Table));
p->next = table;
table = p;
p->word = root->word;
p->start = codesize;
p->code[--p->start] = '\0';
q = root->parent;
r = root;
while(q){
p->code[--p->start] = '0' + (q->left != r);
r = q;
q = q->parent;
}
}
}
}
}
//輸出哈夫曼樹葉子結點信息,中序遍歷
void PrintHFMTree(HFMNode *root)
{
if(root){
PrintHFMTree(root->left);
if(root->left == NULL && root->right == NULL)
printf("字符:%c 權值:%d\n",root->word,root->weight);
PrintHFMTree(root->right);
}
}
//輸出哈夫曼字符字典信息
void PrintTable(Table *t)
{
printf("字符\t哈夫曼碼\n");
for(;t;t = t->next){
printf("%-4c\t%s\n",t->word,t->code + t->start);
}
putchar('\n');
}
//讀取源文件將其進行哈夫曼轉碼
void TransCoding(Table * table)
{
FILE *fp1,*fp2;
Table *p;
char a;
fp1 = fopen("input.data","r");
fp2 = fopen("password.data","w");
while( (a = fgetc(fp1)) != EOF){
for(p = table;p && p->word - a;p = p->next);
if(!p)
{
printf("Found Error In TransCoding!\n");
exit(0);
}
fputs(p->code + p->start,fp2);
}
fclose(fp1);
fclose(fp2);
}
void ReTransCoding(HFMNode * root)
{
FILE *fp1,*fp2;
HFMNode *p;
char a = 0;
fp1 = fopen("password.data","r");
fp2 = fopen("output.data","w");
while( a != EOF )
{
p = root;
while(1){
a = fgetc(fp1);
if(a - '0')
p = p->right;
else
p = p->left;
if(p->word)
{
fputc(p->word,fp2);
break;
}
}
}
fclose(fp1);
fclose(fp2);
}
void PrintFileInformation(char FileName[])
{
FILE *fp;
char a;
//打印文件
printf("%s內容如下:\n",FileName);
if( (fp = fopen(FileName,"r")) == NULL ){
printf("%s打開失敗!\n",FileName);
exit(0);
}
while( (a = fgetc(fp)) != EOF ){
putchar(a);
}
printf("\n\n");
fclose(fp);
}
void SelectFile(void)
{
PrintFileInformation((char *)"input.data");
PrintFileInformation((char *)"password.data");
PrintFileInformation((char *)"output.data");
}
void DestroyHFMTree(HFMNode *root)
{
if(root){
DestroyHFMTree(root->left);
DestroyHFMTree(root->right);
free(root);
}
}
void DestroyTable(Table *table)
{
Table *p;
while(table)
{
p = table;
table = table->next;
free(p);
}
}
int main(void)
{
HFMNode *F;//森林
HFMNode *root;//最優二叉樹根節點
Table *table = NULL;//哈夫曼譯碼字典
int n;
//從文件中讀取文章到內存,存儲在vector<Word> Wordtable中
F = ReadFile();
printf("權值確認完畢...\n\n");
//基於上表建立最優二叉樹
root = CreateHFMTree(F);
printf("最優二叉樹建立完畢...\n\n");
//輸出HFMTree
printf("輸出最優二叉樹有效結點:\n");
PrintHFMTree(root);
putchar('\n');
//建立HFM譯碼字典
HFMCode(root,table);
printf("譯碼字典建立完畢...\n\n");
//輸出HFM譯碼字典
printf("輸出譯碼字典:\n");
PrintTable(table);
//讀入文章進行轉碼處理
TransCoding(table);
printf("源文件轉碼完畢...\n\n");
//二進制傳輸文件譯碼處理
ReTransCoding(root);
printf("二進制文件譯碼完畢...\n\n");
//將源文件,二進制文件,譯碼文件打印在DOS屏幕上
SelectFile();
//內存釋放
DestroyHFMTree(root);
DestroyTable(table);
printf("程序結束,清空內存完畢...\n");
return 0;
}
哈夫曼樹-貪心算法的應用實例
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.