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
|
#include <iostream>
#include <map>
using namespace std;
typedef struct _dsetNode
{
char data;
int rank;
_dsetNode *parent;
}dsetNode;
int count = 0;
map<char, dsetNode*> mymap;
void MakeSet(char data)
{
dsetNode* node = new dsetNode;
node->data = data;
mymap[data] = node;
node->rank = 1;
node->parent = node;
::count++;
}
dsetNode *FindSetRoot(dsetNode *node)
{
if (node != node->parent)
{
node->parent = FindSetRoot(node->parent);
}
return node->parent;
}
char FindSet(char x)
{
dsetNode *node = mymap[x];
node = FindSetRoot(node);
return node->data;
}
bool isconnected(char x, char y)
{
return (FindSet(x) == FindSet(y));
}
void LinkSet(char x, char y)
{
if (isconnected(x, y))
{
return;
}
dsetNode *node1 = mymap[x];
dsetNode *node2 = mymap[y];
if (node1->rank > node2->rank)
{
node2->parent = node1;
node1->rank += node2->rank;
}
else
{
node1->parent = node2;
node2->rank += node1->rank;
}
::count--;
}
void UnionSet(char x, char y)
{
LinkSet(FindSet(x), FindSet(y));
}
void freeset(char arr[], int n)
{
for (int i = 0; i < n; ++i)
{
dsetNode *node = mymap[arr[i]];
delete node;
}
}
void QuickSort(int array[], int low, int high, char edgein[], char edgeout[])
{
int i = low, j = high;
int pivot = array[(low + high)/2];
while (i <= j)
{
while (array[i] < pivot)
{
++i;
}
while (array[j] > pivot)
{
--j;
}
if (i <= j)
{
int i_tmp = array[i];
array[i] = array[j];
array[j] = i_tmp;
char c_tmp = edgein[i];
edgein[i] = edgein[j];
edgein[j] = c_tmp;
c_tmp = edgeout[i];
edgeout[i] = edgeout[j];
edgeout[j] = c_tmp;
++i;
--j;
}
}
if (i < high)
{
QuickSort(array, i, high, edgein, edgeout);
}
if (j > low)
{
QuickSort(array, low, j, edgein, edgeout);
}
}
void MSTKruskal(char vertices[], char edgein[], char edgeout[], int weight[], int n, int m)
{
for (int i = 0; i < n; ++i)
{
MakeSet(vertices[i]);
}
QuickSort(weight, 0, m-1, edgein, edgeout);
int A = 0;
cout << "最小生成树包含的边界：" << endl;
for (int i = 0; i < m && ::count > 1; ++i)
{
if (isconnected(edgein[i], edgeout[i]))
{
continue;
}
UnionSet(edgein[i], edgeout[i]);
A += weight[i];
cout << "\t" << edgein[i] << "--" << edgeout[i] << endl;
}
cout << "最小生成树总共的权重为： " << A << endl;
freeset(vertices, n);
}
int main(int argc, const char * argv[]) {
char vertices[] = {'A', 'B', 'C', 'D', 'E', 'F'};
char edgein[] = {'A', 'A', 'A', 'B', 'B', 'C', 'C', 'D', 'D'};
char edgeout[] = {'B', 'D', 'C', 'D', 'E', 'D', 'F', 'E', 'F'};
int weight[] = {6, 5, 3, 8, 2, 2, 6, 5, 3};
int n = sizeof(vertices) / sizeof(vertices[0]);
int m = sizeof(weight) / sizeof(weight[0]);
MSTKruskal(vertices, edgein, edgeout, weight, n, m);
return 0;
}
|
