test.c

来自「用哈夫曼编码实现文件压缩和解压缩. 压缩过程的实现：1创建Haffman树&#」· C语言 代码 · 共 38 行

#include "ECBTree.h"
#include "MyAssert.h"
#include "Ulti.h"
#include <stdio.h>
#include <stdlib.h>

int* initList;

void main()
{
	FILE* inputFile,* outputFile;
	int len;
	int i;
	
	PHtTree myHtTree;
	
	assertF((inputFile=fopen("inputData2.txt","rb"))!=NULL,"open file error");
	assertF((outputFile=fopen("outputData.txt","wb"))!=NULL,"open file error");
	
	fscanf(inputFile,"len=%d;\r\n",&len);
	
	initList=(int*)malloc(sizeof(int)*len);
	
	for(i=0;i<len-1;i++)
		fscanf(inputFile,"%d,",&initList[i]);
	fscanf(inputFile,"%d;",&initList[i]);
	
	for(i=0;i<len;i++)
		printf("%d->",initList[i]);
	printf("===========");

	myHtTree=haffmanAlgorithm(len,initList);
	
	preHtOrder(myHtTree,myHtTree->rootIndex);
	
	getchar();
}