算法导论并查集

最新推荐文章于 2021-04-28 00:01:23 发布

microsoftwin32

最新推荐文章于 2021-04-28 00:01:23 发布

阅读量884

点赞数

分类专栏：算法导论文章标签：算法 null struct p2p c

本文链接：https://blog.csdn.net/microsoftwin32/article/details/7909838

版权

算法导论专栏收录该内容

13 篇文章 1 订阅

订阅专栏

并查集
#include<iostream>
using namespace std;
typedef char NodeItemType;
typedef struct Node
{
	Node* p;
	NodeItemType key;
	int rank;
}TreeNode,*pTreeNode;
void MAKE_SET(pTreeNode x)
{
	x->p=x;
	x->rank=0;
}
void LINK(pTreeNode x,pTreeNode y)
{
	if(x->rank>y->rank)
		y->p=x;
	else
		x->p=y;
	if(x->rank==y->rank)
		y->rank=y->rank+1;
}
pTreeNode FIND_SET(pTreeNode x)
{
	if(x!=x->p)
		x->p=FIND_SET(x->p);
	return x->p;
}
void UNION(pTreeNode x,pTreeNode y)
{
	LINK(FIND_SET(x),FIND_SET(y));
}
int main()
{
	TreeNode node[10]={
		{NULL,'a',0},{NULL,'b',0},{NULL,'c',0},
		{NULL,'d',0},{NULL,'e',0},{NULL,'f',0},
		{NULL,'g',0},{NULL,'h',0},{NULL,'i',0},
		{NULL,'j',0}};
	for(int i=0;i<10;i++)
		MAKE_SET(&node[i]);
	UNION(&node[1],&node[3]);
	UNION(&node[4],&node[6]);
	UNION(&node[0],&node[2]);
	UNION(&node[7],&node[8]);
	UNION(&node[0],&node[1]);
	UNION(&node[4],&node[5]);
	UNION(&node[1],&node[2]);
	pTreeNode p1,p2;
	p1=FIND_SET(&node[0]);
	p2=FIND_SET(&node[3]);
	if(p1==p2)
		cout<<"OK!"<<endl;
	else
		cout<<"Not in a array!"<<endl;
	return 0;
}