GraphGen/GraphGen.h at main · qqwerty741/GraphGen · 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
#pragma once
#include<vector>
//#include <chrono>
//#include<algorithm>
//#include<iostream>


struct Graph
{
	int seed, e, v;
	std::vector<std::vector<int>> mtx;
	std::vector<std::pair<int, int>> edges;
	std::vector<std::vector<int>> listsm;
};

auto genTree(int minG = 0, int maxG = 1e7, int seed = std::chrono::steady_clock::now().time_since_epoch().count()) {
	std::mt19937 a(seed);
	long long v = a() % (maxG - minG + 1) + minG;
	std::vector<int> ans;
	ans.push_back(-1);
	std::vector<std::vector<int>> ans2(v, std::vector<int>(v, 0));
	Graph Ans;
	Ans.seed = seed;
	for (unsigned long long i = 1; i < v; i++)
		ans.push_back(a() % i);
	for (unsigned long long i = 0; i < ans.size(); i++)
		if (ans[i] != -1) {
			ans2[i][ans[i]] = ans2[ans[i]][i] = 1;
			Ans.edges.emplace_back(i, ans[i]);
		}
	Ans.mtx = ans2;
	Ans.v = v;
	Ans.e = Ans.edges.size();
	return Ans;
}

auto genGraph(int minG = 0, int maxG = 1e9, int minS = 0, int maxS = 1e5, int seed = std::chrono::steady_clock::now().time_since_epoch().count()) {
	std::mt19937 a(seed);
	long long v = a() % (maxG - minG + 1) + minG;
	maxS = (maxS > (v * (v - 1)) / 2 ? (v * (v - 1)) / 2 : maxS);
	long long d = a() % (maxS - minS + 1) + minS;
	std::vector<std::vector<int>> ans(v, std::vector<int>(v, 0));
	Graph Ans;
	Ans.listsm.resize(v);
	for (int i = 0; i < d; i++) {
		int q = a() % v, w = a() % v;
		if (q == w)i--;
		else if (ans[q][w] == 1)i--;
		else {
			ans[q][w] = ans[w][q] = 1;
			Ans.edges.emplace_back(q, w);
			Ans.listsm[q].push_back(w);
			Ans.listsm[w].push_back(q);
		}
	}
	Ans.seed = seed;
	Ans.mtx = ans;
	Ans.v = v;
	Ans.e = Ans.edges.size();
	return Ans;
}

auto genMulti(int minG = 0, int maxG = 1e9, int minS = 0, int maxS = 1e5, int seed = std::chrono::steady_clock::now().time_since_epoch().count()) {
	std::mt19937 a(seed);
	long long v = a() % (maxG - minG + 1) + minG;
	long long d = a() % (maxS - minS + 1) + minS;
	std::vector<std::vector<int>> ans(v, std::vector<int>(v, 0));
	Graph Ans;
	Ans.seed = seed;
	if(v!=1)
	for (int i = 0; i < d; i++) {
		int q = a() % v, w = a() % v;
		if (q == w)i--;
		else {
			ans[q][w] = ans[w][q] = ans[w][q] + 1;
			Ans.edges.emplace_back(q, w);
		}
	}
	Ans.mtx = ans;
	Ans.v = v;
	Ans.e = Ans.edges.size();
	return Ans;
}

auto genDirGraph(int minG = 0, int maxG = 1e9, int minS = 0, int maxS = 1e5, int seed = std::chrono::steady_clock::now().time_since_epoch().count()) {
	std::mt19937 a(seed);
	long long v = a() % (maxG - minG + 1) + minG;
	maxS = (maxS > (v * (v - 1)) / 2 ? (v * (v - 1)) / 2 : maxS);
	long long d = a() % (maxS - minS + 1) + minS;
	std::vector<std::vector<int>> ans(v, std::vector<int>(v, 0));
	Graph Ans;
	for (int i = 0; i < d; i++) {
		int q = a() % v, w = a() % v;
		if (q == w)i--;
		else if (ans[q][w] == 1)i--;
		else {
			ans[q][w] = 1;
			Ans.edges.emplace_back(q, w);
		}
	}
	Ans.seed = seed;
	Ans.mtx = ans;
	Ans.v = v;
	Ans.e = Ans.edges.size();
	return Ans;
}

auto genPseudo(int minG = 0, int maxG = 1e9, int seed = std::chrono::steady_clock::now().time_since_epoch().count()) {
	std::mt19937 a(seed);
	long long v = a() % (maxG - minG + 1) + minG;
	std::vector<std::vector<int>> ans(v, std::vector<int>(v, 0));
	Graph Ans;
	Ans.seed = seed;
	if (v != 1)
		for (int i = 1; i < v; i++) {
			for (int j = 0; j <= i; j++) {
				ans[i][j] = ans[j][i] = a() % 2;
				Ans.edges.emplace_back(i, j);
			}
		}
	Ans.mtx = ans;
	Ans.v = v;
	Ans.e = Ans.edges.size();
	return Ans;
}

auto genBipart(int minG = 0, int maxG = 1e9, int seed = std::chrono::steady_clock::now().time_since_epoch().count()){
	std::mt19937 a(seed);
	long long v = a() % (maxG - minG + 1) + minG;
	std::vector <std::vector <int>> g(v, std::vector <int>(v, 0));
	std::vector <int> d(v, 0);
	int e = 0;
	int dp = 0;
	Graph Ans;
	Ans.listsm.resize(v);
	for (int i = 0; i < v; i++) {
		d[i] = a() % 2;
		dp += d[i];
	}
	for (int i = 1; i < v; i++) {
		for(int j = 0; j < i; j++){
			if(d[i] != d[j]){
				g[i][j] = a() % 2;
				g[j][i] = g[i][j];
				e += g[i][j];
				if (g[i][j] == 1) {
					Ans.listsm[i].push_back(j);
					Ans.listsm[j].push_back(i);
					Ans.edges.emplace_back(i, j);

				}
			}
		}
	}
	Ans.seed = seed;
	Ans.mtx = g;
	Ans.v = v;
	Ans.e = e;
	return Ans;
}

auto genCyclic(int minG = 0, int maxG = 1e7, int seed = std::chrono::steady_clock::now().time_since_epoch().count()) {
	std::mt19937 a(seed);
	long long v = a() % (maxG - minG + 1) + minG;
	std::vector<int> ans;
	ans.push_back(-1);
	std::vector<std::vector<int>> ans2(v, std::vector<int>(v, 0));
	Graph Ans;
	Ans.seed = seed;
	for (unsigned long long i = 1; i < v; i++)
		ans.push_back(a() % i);
	for (unsigned long long i = 0; i < ans.size(); i++)
		if (ans[i] != -1) {
			ans2[i][ans[i]] = ans2[ans[i]][i] = 1;
			Ans.edges.emplace_back(i, ans[i]);
		}
	std::vector<int> r(v, 0);
	for (int i = 0; i < v; i++)
		r[i] = i;
	for (int i = 0; i < v; i++) {
		int z;
		int zf = a() % v;
		z = r[i];
		r[i] = r[zf];
		r[zf] = z;
	}
	int fl = 0;
	for(int i = 1; i < v; i++)
		if(!ans2[r[0]][r[i]]){
			ans2[r[0]][r[i]] = ans2[r[i]][r[0]] = 1;
			fl = 1;
			break;
		}
	if (!fl)
		ans2[r[1]][r[2]] = ans2[r[2]][r[1]] = 1;
	Ans.mtx = ans2;
	Ans.v = v;
	Ans.e = Ans.edges.size();
	return Ans;
}