新建 文本文档.txt

来自「数据结构赫夫曼编码」· 文本 代码 · 共 78 行

#include "iostream.h"
define max；
//HuffmanTree 的接点结构
struct HuNode
{
    char data;
    unsigned int weight;
    unsigned int parent,lchild,rchild;
}

//HuffmanTree 类
class Huffman
{
public:
   Huffman(int);
   ~Huffman();
   bool creatHuffman();
   bool HuffmanCoding();
   void HuffmanOutput();
private:
   HuNode *tree;
   int size;
}
Huffman::Huffman(int n)
{
   int temp[2*n-1] = new int[2*n-1];
   tree = temp;
   size = n;
}
bool Huffman::creatHuffman()
{
   for(int i=0;i<size;i++)
   {
      cin>>tree[i].data;
      cin>>tree[i].weigth;
   }
}
bool Huffman::HuffmanCoding()
{
    if(size < 0 )
       return true;
    else
    {
      for(int i=0;i<size;i++)
      {
	 int m,n;
         mindouble(HuNode tree,m,n);
         tree[i+1].lchild = m;
         tree[i+1].rchild = n;
	 tree[i+1].weigth = tree[m].weigth + tree[n].weigth 
         tree[m].weigth = max; 
         tree[n].weigth = max;       
      }
      size--;
    }    
}
void Huffman::HuffmanOutPut()
{
   for(int i=size;i>=0;i--)
   {      
      while()
      {
      }   
   }
}

//测试部分
void main()
{
   Huffman test(6);
   if(test.creatHuffman())
   {
      test.HuffmanCoding();
      test.HuffmanOutput();
   }
   esle
     out<<"创建有错误"<<endl;
}