Test-Case-Generator/TreeTypes.cpp at master · shriramch/Test-Case-Generator · GitHub

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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
# include "TreeTypes.h"

// A constructor
Rtree :: Rtree()
{
	N = 0;
	generator.seed(system_clock :: now().time_since_epoch().count());
}

// A function that generates a random tree
void Rtree :: generate(int n, Timer &t1)
{
	int a[n + 1];
	for(int i = 1; i < n + 1; i++)
	{
		t1.time(1);
		a[i] = i;
	}
	shuffle(a + 1, a + n + 1, default_random_engine(system_clock  :: now().time_since_epoch().count()));
	g.clear();
	for(int i = 2; i < n + 1; i++)
	{
		int u = a[i];
		uniform_int_distribution <int> d1(1, i - 1);
		int v = a[d1(generator)];
		int x = rand() % 2;
		if(x)
			g.push_back(make_pair(u, v));
		else g.push_back(make_pair(v, u));
		t1.time(1);
	}
	t1.time(1);
	shuffle(g.begin(), g.end(), default_random_engine(system_clock  :: now().time_since_epoch().count()));
	for(auto i : g)
	{
		fout << i.first << ' ' << i.second << '\n';
		t1.time(1);
	}
	t1.time(1);
}

// A function that generates tree test case files
void Rtree :: setCase(string &s, int T, int t, int n, int sz, string &folder_name)
{
	int pt = FileOp :: printT(t);
	cout << "Generating tree test files: " << '\n';
	for(int i = 0; i < T; i++)
	{
		FileOp :: setFile(folder_name, s, i, fout);
		vector <int> times = numOp :: giveRints(t, n, sz);
		N = times.size();
		if(pt)
			fout << N << '\n';
		int tcnt = 0;
		for(int j = 0; j < N; j++)
			tcnt += times[j];
		Timer t1(3 * tcnt);
		for(int j = 0; j < N; j++)
		{
			fout << times[j] << '\n';
			generate(times[j], t1);
		}
		fout.close();
	}
	cout << "tree generation completed." << '\n';
}

// A constructor
Rrtree :: Rrtree()
{
	N = 0;
	generator.seed(system_clock :: now().time_since_epoch().count());
}

// A function that generates a random rooted tree
void Rrtree :: generate(int n, Timer &t1)
{
	int a[n + 1];
	for(int i = 1; i < n + 1; i++)
	{
		t1.time(1);
		a[i] = i;
	}
	shuffle(a + 2, a + n + 1, default_random_engine(system_clock  :: now().time_since_epoch().count()));
	g.clear();
	for(int i = 2; i < n + 1; i++)
	{
		int u = a[i];
		uniform_int_distribution <int> d1(1, i - 1);
		int v = a[d1(generator)];
		int x = rand() % 2;
		if(x)
			g.push_back(make_pair(u, v));
		else g.push_back(make_pair(v, u));
		t1.time(1);
	}
	t1.time(1);
	shuffle(g.begin(), g.end(), default_random_engine(system_clock  :: now().time_since_epoch().count()));
	for(auto i : g)
	{
		fout << i.first << ' ' << i.second << '\n';
		t1.time(1);
	}
	t1.time(1);
}

// A function that generates rooted tree test case files
void Rrtree :: setCase(string &s, int T, int t, int n, int sz, string &folder_name)
{
	int pt = FileOp :: printT(t);
	cout << "Generating rtree test files: " << '\n';
	for(int i = 0; i < T; i++)
	{
		FileOp :: setFile(folder_name, s, i, fout);
		vector <int> times = numOp :: giveRints(t, n, sz);
		N = times.size();
		if(pt)
			fout << N << '\n';
		int tcnt = 0;
		for(int j = 0; j < N; j++)
			tcnt += times[j];
		Timer t1(3 * tcnt);
		for(int j = 0; j < N; j++)
		{
			fout << times[j] << '\n';
			generate(times[j], t1);
		}
		fout.close();
	}
	cout << "rtree generation completed." << '\n';
}

// A constructor
Rwtree :: Rwtree()
{
	N = 0;
	generator.seed(system_clock :: now().time_since_epoch().count());
}

// A function that generates a random weighted tree
void Rwtree :: generate(int n, Timer &t1, int l, int r)
{
	int a[n + 1];
	vector <int> weights;
	if(l < 0)
		Distribution :: FillArray(weights, n - 1, l, r, true, t1);
	else Distribution :: FillArray(weights, n - 1, l, r, false, t1);
	for(int i = 1; i < n + 1; i++)
	{
		t1.time(1);
		a[i] = i;
	}
	shuffle(a + 1, a + n + 1, default_random_engine(system_clock  :: now().time_since_epoch().count()));
	g.clear();
	for(int i = 2; i < n + 1; i++)
	{
		int u = a[i];
		uniform_int_distribution <int> d1(1, i - 1);
		int v = a[d1(generator)];
		int x = rand() % 2;
		int w = weights[i - 2];
		if(x)
			g.push_back(make_tuple(u, v, w));
		else g.push_back(make_tuple(v, u, w));
		t1.time(1);
	}
	t1.time(1);
	shuffle(g.begin(), g.end(), default_random_engine(system_clock  :: now().time_since_epoch().count()));
	for(auto i : g)
	{
		fout << get <0> (i) << ' ' << get <1> (i) << ' ' << get <2> (i) << '\n';
		t1.time(1);
	}
	t1.time(1);
}

// A function that generates weighted tree test case files
void Rwtree :: setCase(string &s, int T, int t, int n, int l, int r, int sz, string &folder_name)
{
	int pt = FileOp :: printT(t);
	cout << "Generating wtree test files: " << '\n';
	for(int i = 0; i < T; i++)
	{
		FileOp :: setFile(folder_name, s, i, fout);
		vector <int> times = numOp :: giveRints(t, n, sz);
		N = times.size();
		if(pt)
			fout << N << '\n';
		int tcnt = 0;
		for(int j = 0; j < N; j++)
			tcnt += times[j];
		Timer t1(4 * tcnt);
		for(int j = 0; j < N; j++)
			t1.time(1);
		for(int j = 0; j < N; j++)
		{
			fout << times[j] << '\n';
			generate(times[j], t1, l, r);
		}
		fout.close();
	}
	cout << "wtree generation completed." << '\n';
}

// A constructor
Rvwtree :: Rvwtree()
{
	N = 0;
	generator.seed(system_clock :: now().time_since_epoch().count());
}

// A function that generates a random vertex weighted tree
void Rvwtree :: generate(int n, Timer &t1, int l, int r)
{
	int a[n + 1];
	vector <int> weights;
	if(l < 0)
		Distribution :: FillArray(weights, n, l, r, true, t1);
	else Distribution :: FillArray(weights, n, l, r, false, t1);
	for(int i = 1; i < n + 1; i++)
	{
		t1.time(1);
		a[i] = i;
	}
	for(int i = 1; i < n + 1; i++)
	{
		t1.time(1);
		fout << weights[i - 1] << " \n"[i == n];
	}
	shuffle(a + 1, a + n + 1, default_random_engine(system_clock  :: now().time_since_epoch().count()));
	g.clear();
	for(int i = 2; i < n + 1; i++)
	{
		int u = a[i];
		uniform_int_distribution <int> d1(1, i - 1);
		int v = a[d1(generator)];
		int x = rand() % 2;
		if(x)
			g.push_back(make_pair(u, v));
		else g.push_back(make_pair(v, u));
		t1.time(1);
	}
	t1.time(1);
	shuffle(g.begin(), g.end(), default_random_engine(system_clock  :: now().time_since_epoch().count()));
	for(auto i : g)
	{
		fout << i.first << ' ' << i.second << '\n';
		t1.time(1);
	}
	t1.time(1);
}

// A function that generates vertex weighted tree test case files
void Rvwtree :: setCase(string &s, int T, int t, int n, int l, int r, int sz, string &folder_name)
{
	int pt = FileOp :: printT(t);
	cout << "Generating vwtree test files: " << '\n';
	for(int i = 0; i < T; i++)
	{
		FileOp :: setFile(folder_name, s, i, fout);
		vector <int> times = numOp :: giveRints(t, n, sz);
		N = times.size();
		if(pt)
			fout << N << '\n';
		int tcnt = 0;
		for(int j = 0; j < N; j++)
			tcnt += times[j];
		Timer t1(5 * tcnt);
		for(int j = 0; j < N; j++)
		{
			fout << times[j] << '\n';
			generate(times[j], t1, l, r);
		}
		fout.close();
	}
	cout << "vwtree generation completed." << '\n';
}

// A constructor
Rrwtree :: Rrwtree()
{
	N = 0;
	generator.seed(system_clock :: now().time_since_epoch().count());
}

// A function that generates a random rooted weighted tree
void Rrwtree :: generate(int n, Timer &t1, int l, int r)
{
	int a[n + 1];
	vector <int> weights;
	if(l < 0)
		Distribution :: FillArray(weights, n - 1, l, r, true, t1);
	else Distribution :: FillArray(weights, n - 1, l, r, false, t1);
	for(int i = 1; i < n + 1; i++)
	{
		t1.time(1);
		a[i] = i;
	}
	shuffle(a + 2, a + n + 1, default_random_engine(system_clock  :: now().time_since_epoch().count()));
	g.clear();
	for(int i = 2; i < n + 1; i++)
	{
		int u = a[i];
		uniform_int_distribution <int> d1(1, i - 1);
		int v = a[d1(generator)];
		int x = rand() % 2;
		int w = weights[i - 2];
		if(x)
			g.push_back(make_tuple(u, v, w));
		else g.push_back(make_tuple(v, u, w));
		t1.time(1);
	}
	t1.time(1);
	shuffle(g.begin(), g.end(), default_random_engine(system_clock  :: now().time_since_epoch().count()));
	for(auto i : g)
	{
		fout << get <0> (i) << ' ' << get <1> (i) << ' ' << get <2> (i) << '\n';
		t1.time(1);
	}
	t1.time(1);
}

// A function that generates rooted weighted tree test case files
void Rrwtree :: setCase(string &s, int T, int t, int n, int l, int r, int sz, string &folder_name)
{
	int pt = FileOp :: printT(t);
	cout << "Generating wrtree test files: " << '\n';
	for(int i = 0; i < T; i++)
	{
		FileOp :: setFile(folder_name, s, i, fout);
		vector <int> times = numOp :: giveRints(t, n, sz);
		N = times.size();
		if(pt)
			fout << N << '\n';
		int tcnt = 0;
		for(int j = 0; j < N; j++)
			tcnt += times[j];
		Timer t1(4 * tcnt);
		for(int j = 0; j < N; j++)
			t1.time(1);
		for(int j = 0; j < N; j++)
		{
			fout << times[j] << '\n';
			generate(times[j], t1, l, r);
		}
		fout.close();
	}
	cout << "wrtree generation completed." << '\n';
}