c 语言解码程序哈夫曼树,哈夫曼树编码|Huffman编码 C源码

#include

#include

#include

typedef struct {

int weight;

int parent, lchild, rchild;

char charr;

} HTNode, *HuffmanTree;

typedef char **HuffmanCode;

void Select(HuffmanTree HT, int i, int *s1, int *s2) {

int j, k = 1;

while (HT[k].parent != 0)

k++;

*s1 = k;

for (j = 1; j <= i; ++j)

if (HT[j].parent == 0 && HT[j].weight < HT[*s1].weight)

*s1 = j;

k = 1;

while ((HT[k].parent != 0 || k == *s1))

k++;

*s2 = k;

for (j = 1; j <= i; ++j)

if (HT[j].parent == 0 && HT[j].weight < HT[*s2].weight && j != *s1)

*s2 = j;

}

void HuffmanCoding(HuffmanTree *HT, int *w, int n) {

int m, i, s1, s2;

HuffmanTree p;

if (n <= 1) return;

m = 2 * n - 1;

*HT = (HuffmanTree) malloc((m + 1) * sizeof(HTNode));

for (i = 1; i <= n; ++i) {

(*HT)[i].weight = w[i];

(*HT)[i].lchild = 0;

(*HT)[i].rchild = 0;

(*HT)[i].parent = 0;

}

for (i = n + 1; i <= m; ++i) {

(*HT)[i].weight = 0;

(*HT)[i].lchild = 0;

(*HT)[i].rchild = 0;

(*HT)[i].parent = 0;

}

for (i = n + 1; i <= m; ++i) {

Select(*HT, i - 1, &s1, &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("\n哈弗曼树表如下：\n");

printf(" i weight parent lchild rchild\n");

for (p = (*HT) + 1, i = 1; i <= m; i++, p++)

printf("%2d%7d%7d%7d%7d\n", i, p->weight, p->parent, p->lchild, p->rchild);

}

void Huffmancode(HuffmanTree *HT, HuffmanCode *HC, int n) {

char cd[100];

int c, f, start;

int i;

*HC = (HuffmanCode) malloc((n + 1) * 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]);

}

printf("\n哈夫曼编码如下:");

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]);

printf("\nHT[%d] 节点的哈夫曼编码是: %s 对应权值为：%d", i, (*HC)[i], (*HT)[i].weight);

}

printf("\n");

free(cd);

}

int main() {

HuffmanTree HT;

HuffmanCode HC;

int w[100];

int i, n, wei;

printf("--请输入哈弗曼树的带权数目--\n");

scanf("%d", &n);

for (i = 1; i <= n; i++) {

printf("--请输入第%d个元素的权值--", i);

scanf("%d", &wei);

w[i] = wei;

}

HuffmanCoding(&HT, w, n);

Huffmancode(&HT, &HC, n);

return 0;

}