void Select(HuffmanTree &HT, int n,int s1, int s2) {
int min;//定义临时变量保留最小值
for (int i = 0; i < n; i++) {
if (HT[i].parent == 0) {
min = i; break;
}
}
for (int i = 0; i < n; i++) {
if (HT[i].parent == 0 && HT[i].weight < HT[min].weight) min = i;
s1 = min;
}
for (int i = 0; i < n; i++) {
if (HT[i].parent == 0&&i!=s1) {
min = i; break;
}
}
for (int i = 0; i < n; i++) {
if (HT[i].parent == 0&&i!=s1&& HT[i].weight < HT[min].weight) min = i;
s2 = min;
}
}
void CreatHuffmanTree(HuffmanTree &HT, map<char, float>arr, const char*filename) {
int n = arr.size();
if (n <= 1)return;
int m = 2 * n - 1;
HT = new HTNode[m + 1];
map<char, float>::iterator iter;
int j;
for (iter = arr.begin(), j = 1; iter != arr.end(); iter++,j++) {
HT[j].weight = iter->second, HT[j].parent = 0, HT[j].lchild = 0, HT[j].rchild = 0;
}
for (int i = n + 1; i <= m; i++) {
HT[j].weight = iter->second, HT[j].parent = 0, HT[j].lchild = 0, HT[j].rchild = 0;
}
for (int i = n + 1; i <= m; ++i) {
int s1, s2;
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;
}
FILE *f;
f = fopen(filename, "wt");
if (f == NULL)cout << "open file is error" << "\n";
fprintf_s(f, "%s\n", "构建的Huffman树如下：");
HuffmanTree p2 = HT;
for(int i=1;i<=m;i++,p2++){
fprintf_s(f, "%f %d %d\n", p2->weight, p2->parent, p2->lchild);
}
fclose(f);
}
int main()
{
map<char, float>arr;
HuffmanTree HT;
frequency("d:/input.txt", "output.txt", arr);
CreatHuffmanTree(HT, arr, "t3.txt");
system("pause");
return 0;
}
main中调用CreatHuffmanTree后，没有执行
