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
|
#include "../util.h"
constexpr ll INF = LL::INF;
namespace stoerWagner {
#include <graph/stoerWagner.cpp>
void addEdge(int u, int v, ll c) {
adj[u].push_back({u, v, c});
adj[v].push_back({v, u, c});
}
}
namespace pushRelabel {
#include <graph/pushRelabel.cpp>
ll minCut() {
ll res = INF;
for (int i = 0; i < ssize(adj); i++) {
for (int j = 0; j < i; j++) {
if (i == j) continue;
res = min(res, maxFlow(i, j));
for (auto& v : adj) {
for (auto& e : v) {
e.f = 0;
}
}
}
}
return res;
}
}
void stress_test() {
ll queries = 0;
for (int tries = 0; tries < 5'000; tries++) {
int n = Random::integer<int>(2, 30);
int m = Random::integer<int>(n-1, max<int>(n, min<int>(500, n*(n-1) / 2 + 1)));
stoerWagner::adj.assign(n, {});
pushRelabel::adj.assign(n, {});
Graph<NoData> g(n);
g.erdosRenyi(m);
g.forEdges([](int a, int b){
ll w = Random::integer<ll>(1, 1'000'000'000'000ll);
stoerWagner::addEdge(a, b, w);
pushRelabel::addEdge(a, b, w);
pushRelabel::addEdge(b, a, w);
});
ll got = stoerWagner::stoer_wagner();
ll expected = pushRelabel::minCut();
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
queries += n;
}
cerr << "tested random queries: " << queries << endl;
}
constexpr int N = 200;
constexpr int M = 10000;
void performance_test() {
using namespace stoerWagner;
timer t;
Graph<NoData> g(N);
g.erdosRenyi(M);
adj.assign(N, {});
g.forEdges([](int a, int b){
ll w = Random::integer<ll>(1, 1'000'000'000'000ll);
addEdge(a, b, w);
});
t.start();
hash_t hash = stoer_wagner();
t.stop();
if (t.time > 2000) cerr << "too slow: " << t.time << FAIL;
cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}
int main() {
stress_test();
performance_test();
}
|
