select.cpp

来自「一个关于赫夫曼编码与译码的展示程序」· C++ 代码 · 共 18 行

#include"Huffmanhead.h"
extern s1,s2;
void Select(HuffmanTree HT[],int k)//选择parent为0且weight最小的二个节点，其序号分别为s1和s2
{
	int i;
	for (i=1;i<=k && HT[i].parent!=0;i++);
	s1=i;
	for (i=1;i<=k;i++)
		if (HT[i].parent==0 && HT[i].weight<HT[s1].weight) 
			s1=i;
	for (i=1; i<=k;i++)
		if (HT[i].parent==0&&i!=s1)
			break;
		s2=i;
	for (i=1;i<=k;i++)
		if (HT[i].parent==0 && i!=s1 && HT[i].weight<HT[s2].weight) 
			s2=i;
}