2huffman编码源程序.txt

附1：Huffman编码C源代码

源代码列表：stdafx.h
            Huffman.cpp
预编译头文件：stdafx.h 以下代码

#pragma once
#include <iostream>
#include <tchar.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
控制台应用CPP文件：Huffman.cpp
#include "stdafx.h"
typedef struct
{
unsigned long weight;
int parent, lchild, rchild;
} HTNode, *HuffmanTree;

typedef char** HuffmanCode;

HuffmanCode HC;

void Select(HuffmanTree HT, int n, int *s1, int *s2);

void HuffmanCoding(unsigned long *w, int n)
{
int i;
if( n<=1 ) return;

int m = 2*n - 1;
HuffmanTree p;
HuffmanTree HT = (HuffmanTree)malloc((m+1)*sizeof(HTNode));
memset(HT, 0, sizeof(HTNode) * (m+1));
for( p=HT,i=1; i<=n; ++i)
{
++p;
++w;
p->weight = *w;
}
int s1, s2;
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;
}

HC = (HuffmanCode)malloc((n+1)*sizeof(char*));
char *cd = (char*)malloc(n*sizeof(char));
cd[n-1] = 0;
int start;
unsigned long f;
for( i=1; i<=n; ++i )
{
start = n - 1;
int c;
for( c=i, f=HT[i].parent; f!=0; c=f, f=HT[f].parent )
{