1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
/************************************************************************************
Copyright (C) 2005-2008 Assefaw H. Gebremedhin, Arijit Tarafdar, Duc Nguyen,
Alex Pothen
This file is part of ColPack.
ColPack is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
ColPack is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with ColPack. If not, see <http://www.gnu.org/licenses/>.
************************************************************************************/
#include <iostream>
#include <vector>
using namespace std;
#include "Definitions.h"
#include "DisjointSets.h"
namespace ColPack
{
//Public Constructor 4251
DisjointSets::DisjointSets()
{
}
//Public Constructor 4252
DisjointSets::DisjointSets(int li_SetSize)
{
p_vi_Nodes.clear();
p_vi_Nodes.resize((unsigned) li_SetSize, _UNKNOWN);
}
//Public Destructor 4253
DisjointSets::~DisjointSets()
{
p_vi_Nodes.clear();
}
//Public Function 4254
int DisjointSets::SetSize(int li_SetSize)
{
p_vi_Nodes.clear();
p_vi_Nodes.resize((unsigned) li_SetSize, _UNKNOWN);
return(_TRUE);
}
//Public Function 4255
int DisjointSets::Count()
{
int i;
int li_SetSize, li_HeadCount;
li_SetSize = (signed) p_vi_Nodes.size();
li_HeadCount = _FALSE;
for(i=0; i<li_SetSize; i++)
{
if(p_vi_Nodes[i] < _FALSE)
{
li_HeadCount++;
}
}
return(li_HeadCount);
}
//Public Function 4256
int DisjointSets::Print()
{
int i;
int li_SetSize;
cout<<endl;
cout<<"Disjoint Sets | Tree Structure | Present State"<<endl;
cout<<endl;
li_SetSize = (signed) p_vi_Nodes.size();
for(i=0; i<li_SetSize; i++)
{
if(i == STEP_DOWN(li_SetSize))
{
cout<<p_vi_Nodes[i]<<" ("<<li_SetSize<<")"<<endl;
}
else
{
cout<<p_vi_Nodes[i]<<", ";
}
}
return(_TRUE);
}
//Public Function 4257
int DisjointSets::Find(int li_Node)
{
if(p_vi_Nodes[li_Node] < _FALSE)
{
return(li_Node);
}
else
{
return(Find(p_vi_Nodes[li_Node]));
}
}
//Public Function 4258
int DisjointSets::FindAndCompress(int li_Node)
{
if(p_vi_Nodes[li_Node] < _FALSE)
{
return(li_Node);
}
else
{
return(p_vi_Nodes[li_Node] = FindAndCompress(p_vi_Nodes[li_Node]));
}
}
/* Written by Duc Nguyen
int DisjointSets::Union(int li_SetOne, int li_SetTwo)
{
if(li_SetOne == li_SetTwo)
{
return(_TRUE);
}
p_vi_Nodes[li_SetTwo] = li_SetOne;
return(li_SetOne);
}*/
//* Written by Arijit but seem to be incorrect
//Public Function 4259
int DisjointSets::Union(int li_SetOne, int li_SetTwo)
{
if(li_SetOne == li_SetTwo)
{
return(_TRUE);
}
p_vi_Nodes[li_SetOne] = p_vi_Nodes[li_SetTwo];
return(_TRUE);
}
//*/
//Public Function 4260
int DisjointSets::UnionByRank(int li_SetOne, int li_SetTwo)
{
if(li_SetOne == li_SetTwo)
{
return(_TRUE);
}
if(p_vi_Nodes[li_SetOne] == p_vi_Nodes[li_SetTwo])
{
p_vi_Nodes[li_SetOne]--;
p_vi_Nodes[li_SetTwo] = li_SetOne;
}
if(p_vi_Nodes[li_SetOne] < p_vi_Nodes[li_SetTwo])
{
p_vi_Nodes[li_SetTwo] = li_SetOne;
}
else
{
p_vi_Nodes[li_SetTwo] = p_vi_Nodes[li_SetOne];
p_vi_Nodes[li_SetOne] = li_SetTwo;
}
return(_TRUE);
}
//Public Function 4261
int DisjointSets::UnionBySize(int li_SetOne, int li_SetTwo)
{
if(li_SetOne == li_SetTwo)
{
return(_TRUE);
}
if(p_vi_Nodes[li_SetOne] < p_vi_Nodes[li_SetTwo])
{
p_vi_Nodes[li_SetOne] += p_vi_Nodes[li_SetTwo];
p_vi_Nodes[li_SetTwo] = li_SetOne;
}
else
{
p_vi_Nodes[li_SetTwo] += p_vi_Nodes[li_SetOne];
p_vi_Nodes[li_SetOne] = li_SetTwo;
}
return(_TRUE);
}
}
|
