#include<iostream>
using namespace std;
template<class T>
class UnionFindSets
{
public:
UnionFindSets(T* arr, size_t size)
:_size(size)
, _corspend(new T[size])
{
for (int i = 0; i < size; ++i)
{
_corspend[i] = arr[i];
}
_unionSet = new int[size];
for (int j = 0; j < size; ++j)
{
_unionSet[j] = -1;
}
}
int FindRoot(size_t index)
{
while (_unionSet[index]>= 0)
{
index = _unionSet[index];
}
return index;
}
void Union(size_t index1, size_t index2)
{
int root1 = FindRoot(index1-1);
int root2 = FindRoot(index2-1);
if (root1 != root2)
{
_unionSet[root1] += _unionSet[root2];
_unionSet[root2] = root1;
}
}
int UnionNum()
{
int count = 0;
for (int i = 0; i < _size; ++i)
{
if (_unionSet[i] < 0)
{
++count;
}
}
return count;
}
protected:
T* _corspend;// corresponding下标和键值的对应关系
int* _unionSet;
size_t _size;
};
void Test1()
{
int city[] = { 1,2,3,4,5 };
UnionFindSets<int> u(city, sizeof(city) / sizeof(city[0]));
u.Union(1, 2);
u.Union(2, 3);
u.Union(4, 5);
cout << u.UnionNum() << endl;
}
int main()
{
Test1();
system("pause");
return 0;
}
并查集
最新推荐文章于 2024-07-29 20:58:50 发布