-
Notifications
You must be signed in to change notification settings - Fork 8
/
mtests.cpp
270 lines (236 loc) · 8.73 KB
/
mtests.cpp
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
//
// tests.cpp
// graphlib
//
// Created by Yann Orlarey on 06/02/2017.
// Copyright © 2017 GRAME. All rights reserved.
//
#include "mtests.hh"
#include "dglib/arrow.hh"
#include "dglib/digraph.hh"
#include "dglib/digraphop.hh"
#include "dglib/stdprinting.hh"
bool mcheck(const std::string& testname, const std::string& testvalue, const std::string& expectedvalue)
{
bool ok = (0 == expectedvalue.compare(testvalue));
if (ok) {
std::cout << testname << " SUCCESS " << std::endl;
} else {
std::cout << testname << " FAILED " << std::endl;
std::cout << "We got [[" << testvalue << "]]" << std::endl;
std::cout << "instead of [[" << expectedvalue << "]]" << std::endl;
}
return ok;
}
std::string mtest0()
{
digraph<char, multidep> g;
g.add('A', 'B', mdep("M"))
.add('B', 'C', mdep("M", 1))
.add('C', 'A', mdep("M"))
.add('D', 'B', mdep("M"))
.add('D', 'C', mdep("M"))
.add('D', 'E', mdep("M", 1))
.add('E', 'D', mdep("M"))
.add('E', 'F', mdep("M"))
.add('F', 'G', mdep("M"))
.add('G', 'F', mdep("M", 1))
.add('H', 'G', mdep("M"))
.add('H', 'E', mdep("M"))
.add('H', 'H', mdep("M", 1));
std::stringstream ss;
ss << "g = " << g;
return ss.str();
}
std::string mres0()
{
return "g = Graph {A-std::pair{std::map{std::pair{M, 0}}, 0}->B, "
"B-std::pair{std::map{std::pair{M, 1}}, 1}->C, C-std::pair{std::map{std::pair{M, 0}}, "
"0}->A, D-std::pair{std::map{std::pair{M, 0}}, 0}->B, D-std::pair{std::map{std::pair{M, "
"0}}, 0}->C, D-std::pair{std::map{std::pair{M, 1}}, 1}->E, "
"E-std::pair{std::map{std::pair{M, 0}}, 0}->D, E-std::pair{std::map{std::pair{M, 0}}, "
"0}->F, F-std::pair{std::map{std::pair{M, 0}}, 0}->G, G-std::pair{std::map{std::pair{M, "
"1}}, 1}->F, H-std::pair{std::map{std::pair{M, 0}}, 0}->E, "
"H-std::pair{std::map{std::pair{M, 0}}, 0}->G, H-std::pair{std::map{std::pair{M, 1}}, "
"1}->H}";
}
bool mcheck0()
{
return mcheck("mtest0", mtest0(), mres0());
}
//===================================================================================
std::string mtest1()
{
digraph<char, multidep> g;
g.add('A', 'B', mdep("M"))
.add('B', 'C', mdep("M"))
.add('C', 'A', mdep("M"))
.add('D', 'B', mdep("M"))
.add('D', 'C', mdep("M"))
.add('D', 'E', mdep("M"))
.add('E', 'D', mdep("M"))
.add('E', 'F', mdep("M"))
.add('F', 'G', mdep("M"))
.add('G', 'F', mdep("M"))
.add('H', 'G', mdep("M"))
.add('H', 'E', mdep("M"))
.add('H', 'H', mdep("M"));
std::stringstream ss;
ss << "Tarjan partition of g = ";
Tarjan<char, multidep> tarj(g);
for (const auto& cycle : tarj.partition()) {
ss << "group{ ";
for (const auto& n : cycle) {
ss << n << " ";
}
ss << "} ";
}
return ss.str();
}
std::string mres1()
{
return "Tarjan partition of g = group{ A B C } group{ D E } group{ F G } group{ H } ";
}
bool mcheck1()
{
return mcheck("mtest1", mtest1(), mres1());
}
//===================================================================================
std::string mtest2()
{
digraph<char, multidep> g;
g.add('A', 'B', mdep("M", 2))
.add('A', 'B', mdep("M", 1))
.add('A', 'B', mdep("N", 0))
.add('B', 'C', mdep("M"))
.add('C', 'A', mdep("M"))
.add('D', 'B', mdep("M"))
.add('D', 'C', mdep("M"))
.add('D', 'E', mdep("M"))
.add('E', 'D', mdep("M"))
.add('E', 'F', mdep("M"))
.add('F', 'G', mdep("M"))
.add('G', 'F', mdep("M"))
.add('H', 'G', mdep("M"))
.add('H', 'E', mdep("M"))
.add('H', 'H', mdep("M"));
std::stringstream ss;
ss << "g = " << g;
return ss.str();
}
std::string mres2()
{
return "g = Graph {A-std::pair{std::map{std::pair{M, 1}, std::pair{N, 0}}, 0}->B, "
"B-std::pair{std::map{std::pair{M, 0}}, 0}->C, C-std::pair{std::map{std::pair{M, 0}}, "
"0}->A, D-std::pair{std::map{std::pair{M, 0}}, 0}->B, D-std::pair{std::map{std::pair{M, "
"0}}, 0}->C, D-std::pair{std::map{std::pair{M, 0}}, 0}->E, "
"E-std::pair{std::map{std::pair{M, 0}}, 0}->D, E-std::pair{std::map{std::pair{M, 0}}, "
"0}->F, F-std::pair{std::map{std::pair{M, 0}}, 0}->G, G-std::pair{std::map{std::pair{M, "
"0}}, 0}->F, H-std::pair{std::map{std::pair{M, 0}}, 0}->E, "
"H-std::pair{std::map{std::pair{M, 0}}, 0}->G, H-std::pair{std::map{std::pair{M, 0}}, "
"0}->H}";
}
bool mcheck2()
{
return mcheck("mtest2", mtest2(), mres2());
}
//===================================================================================
std::string mtest3()
{
digraph<char, multidep> g;
g.add('A', 'B', mdep("Y", 1))
.add('A', 'B', mdep("Y", 2))
.add('B', 'C', mdep("Q"))
.add('C', 'A', mdep("X"))
.add('D', 'B', mdep("M"))
.add('D', 'C', mdep("M", 2))
.add('D', 'E', mdep("M"))
.add('E', 'D', mdep("N", 1));
std::stringstream ss;
ss << "g = " << g;
return ss.str();
}
std::string mres3()
{
return "g = Graph {A-std::pair{std::map{std::pair{Y, 1}}, 1}->B, "
"B-std::pair{std::map{std::pair{Q, 0}}, 0}->C, C-std::pair{std::map{std::pair{X, 0}}, "
"0}->A, D-std::pair{std::map{std::pair{M, 0}}, 0}->B, D-std::pair{std::map{std::pair{M, "
"2}}, 2}->C, D-std::pair{std::map{std::pair{M, 0}}, 0}->E, "
"E-std::pair{std::map{std::pair{N, 1}}, 1}->D}";
}
bool mcheck3()
{
return mcheck("mtest3", mtest3(), mres3());
}
//===================================================================================
std::string mtest4()
{
digraph<char, multidep> g;
g.add('A', 'B', mdep("Y", 1))
.add('A', 'B', mdep("Y", 2))
.add('B', 'C', mdep("Q"))
.add('C', 'A', mdep("X"))
.add('D', 'B', mdep("M"))
.add('D', 'C', mdep("W", 2))
.add('D', 'E', mdep("M"))
.add('E', 'D', mdep("N", 1));
std::stringstream ss;
digraph<digraph<char, multidep>, multidep> d = graph2dag(g);
ss << "d = " << d;
return ss.str();
}
std::string mres4()
{
return "d = Graph {Graph {A-std::pair{std::map{std::pair{Y, 1}}, 1}->B, "
"B-std::pair{std::map{std::pair{Q, 0}}, 0}->C, C-std::pair{std::map{std::pair{X, 0}}, "
"0}->A}, Graph {D-std::pair{std::map{std::pair{M, 0}}, 0}->E, "
"E-std::pair{std::map{std::pair{N, 1}}, 1}->D}-std::pair{std::map{std::pair{M, 0}, "
"std::pair{W, 2}}, 0}->Graph {A-std::pair{std::map{std::pair{Y, 1}}, 1}->B, "
"B-std::pair{std::map{std::pair{Q, 0}}, 0}->C, C-std::pair{std::map{std::pair{X, 0}}, "
"0}->A}}";
}
bool mcheck4()
{
return mcheck("mtest4", mtest4(), mres4());
}
//===================================================================================
std::string mtest5()
{
digraph<char, multidep> g;
g.add('A', 'B', mdep("Y", 1))
.add('A', 'B', mdep("Y", 2))
.add('B', 'C', mdep("Q"))
.add('C', 'A', mdep("X"))
.add('D', 'B', mdep("M"))
.add('D', 'C', mdep("W", 2))
.add('D', 'E', mdep("M"))
.add('E', 'D', mdep("N", 1))
.add('G', 'A', mdep("init", 1))
.add('E', 'H', mdep("end", 0));
// inline std::pair<std::map<N, A>, std::map<N, A>> arrows(const digraph<N, A>& G)
std::pair<std::map<char, multidep>, std::map<char, multidep>> PM = arrows(g);
std::stringstream ss;
for (char c : g.nodes()) {
ss << c << ": incoming " << PM.first[c] << ", outcoming: " << PM.second[c] << std::endl;
}
return ss.str();
}
std::string mres5()
{
return "A: incoming std::pair{std::map{std::pair{X, 0}, std::pair{init, 1}}, 0}, outcoming: "
"std::pair{std::map{std::pair{Y, 1}}, 1}\n"
"B: incoming std::pair{std::map{std::pair{M, 0}, std::pair{Y, 1}}, 0}, outcoming: "
"std::pair{std::map{std::pair{Q, 0}}, 0}\n"
"C: incoming std::pair{std::map{std::pair{Q, 0}, std::pair{W, 2}}, 0}, outcoming: "
"std::pair{std::map{std::pair{X, 0}}, 0}\n"
"D: incoming std::pair{std::map{std::pair{N, 1}}, 1}, outcoming: std::pair{std::map{std::pair{M, 0}, "
"std::pair{W, 2}}, 0}\n"
"E: incoming std::pair{std::map{std::pair{M, 0}}, 0}, outcoming: std::pair{std::map{std::pair{N, 1}, "
"std::pair{end, 0}}, 0}\n"
"G: incoming std::pair{std::map{}, 2147483647}, outcoming: std::pair{std::map{std::pair{init, 1}}, 1}\n"
"H: incoming std::pair{std::map{std::pair{end, 0}}, 0}, outcoming: std::pair{std::map{}, 2147483647}\n";
}
bool mcheck5()
{
return mcheck("mtest5", mtest5(), mres5());
}