데이터 구조 --- 집합의 표시
5154 단어 데이터 구조
typedef struct TreeNode* HuffmanTree;
struct TreeNode{
int weight;
HuffmanTree left, right;
};
HuffmanTree Huffman( MinHeap H )
{
int i;
HuffmanTree T;
BuildMinHeap(H);
for( i=1; i<H->size; i++)
{
T = malloc(sizeof(struct TreeNode));
T->left = DeleteMin(H);
T->right = DeleteMin(H);
T->weight = T->left->weight + T->right->weight;
Insert(H, T);
}
T = DeleteMin(H);
return T;
}
집합 적 병렬 연산
void Union( SetType S[], ElementType X1, ElementType X2)
{
int Root1, Root2;
Root1 = Find( S, X1);
Root2 = Find( S, X2);
if(Root1 != Root2) S[Root1].Parent = Root2;
}