blob: ccd98e6ec84c55638aa270a8f21ed6b0910798b0 (
plain)
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
|
#include "../util.h"
namespace tutte {
void gauss(int n, int m);
#include <graph/matching.cpp>
#include <math/shortModInv.cpp>
#include <math/lgsFp.cpp>
}
#include <graph/blossom.cpp>
void stress_test() {
ll queries = 0;
for (int tries = 0; tries < 5'000; tries++) {
int n = Random::integer<int>(1, 30);
int m = Random::integer<int>(0, max<int>(1, n*(n-1) / 2 + 1));
GM blossom(n);
srand(Random::rng());
tutte::adj.assign(n, {});
Graph<NoData> g(n);
g.erdosRenyi(m);
g.forEdges([&](int a, int b){
tutte::adj[a].push_back(b);
tutte::adj[b].push_back(a);
blossom.adj[a].push_back(b);
blossom.adj[b].push_back(a);
});
ll got = tutte::max_matching();
ll expected = blossom.match();
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
queries += n;
}
cerr << "tested random queries: " << queries << endl;
}
constexpr int N = 125;
constexpr int M = 5'000;
void performance_test() {
timer t;
Graph<NoData> g(N);
g.erdosRenyi(M);
srand(Random::rng());
tutte::adj.assign(N, {});
g.forEdges([&](int a, int b){
tutte::adj[a].push_back(b);
tutte::adj[b].push_back(a);
});
t.start();
hash_t hash = tutte::max_matching();
t.stop();
if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}
int main() {
stress_test();
if (!sanitize) performance_test();
}
|
