www.pudn.com > Dijkstra_Huffman_Prim.rar > Huffman.cpp

// Huffman.cpp : Defines the entry point for the console application. 
// 
 
#include "stdafx.h" 
#define NODEMAX 50 
#define MAX 100 
#include  
#include 
 
struct node 
{ int tag; 
  int data; 
  int rc,lc; 
}; 
typedef struct node NODE; 
 
int huffman(NODE r[]) 
{ int y,n,m1,m2,x1,x2,i,j,t; 
  FILE* fp; 
  fp=fopen("outHuffman.txt","w"); 
  ifstream in("inHuffman.txt"); 
  in>>y; 
  n=y; 
  printf("树叶的个数为:%d\n",n); 
  printf("\n从文件读取每个树叶的权值：\n"); 
  for(i=1; i<=n; i++) 
  { in>>y; 
    printf("%d ",y); 
    r[i].data=y; 
	r[i].tag=0; 
	r[i].lc=0; 
	r[i].rc=0; 
  } 
  printf("\n"); 
  printf("\n最优二叉树：\n"); 
  i=0; 
  while(i