summaryrefslogtreecommitdiff
path: root/test/graph/bellmannFord.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
commit98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch)
tree5113d5cc24d1ad5f93810b6442ce584a36950dc8 /test/graph/bellmannFord.cpp
parentad3856a6b766087df0036de0b556f4700a6498c9 (diff)
parent8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff)
mzuenni tests
Diffstat (limited to 'test/graph/bellmannFord.cpp')
-rw-r--r--test/graph/bellmannFord.cpp70
1 files changed, 70 insertions, 0 deletions
diff --git a/test/graph/bellmannFord.cpp b/test/graph/bellmannFord.cpp
new file mode 100644
index 0000000..92f1fef
--- /dev/null
+++ b/test/graph/bellmannFord.cpp
@@ -0,0 +1,70 @@
+#include "../util.h"
+constexpr ll INF = LL::INF;
+struct edge {
+ int from, to;
+ ll cost;
+};
+#include <graph/bellmannFord.cpp>
+namespace floydWarshall {
+#include <graph/floydWarshall.cpp>
+}
+
+void stress_test() {
+ ll queries = 0;
+ for (int tries = 0; tries < 100'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)));
+ vector<ll> potential = Random::integers<ll>(n, 0, 1'000'000'000'000ll);
+
+ vector<edge> edges;
+ floydWarshall::dist.assign(n, vector<ll>(n, INF));
+ for (int i = 0; i < n; i++) floydWarshall::dist[i][i] = 0;
+
+ Graph<NoData, true> g(n);
+ g.erdosRenyi(m);
+ g.forEdges([&](int a, int b){
+ ll w = Random::integer<ll>(1, 100'000'000'000ll);
+ w = potential[b] + w - potential[a];
+ edges.push_back({a, b, w});
+ floydWarshall::dist[a][b] = min(floydWarshall::dist[a][b], w);
+ });
+
+ floydWarshall::floydWarshall();
+ for (int i = 0; i < n; i++) {
+ auto got = bellmannFord(n, edges, i);
+ auto expected = floydWarshall::dist[i];
+
+ if (got != expected) cerr << "error" << FAIL;
+ queries += n;
+ }
+ }
+ cerr << "tested random queries: " << queries << endl;
+}
+
+constexpr int N = 5'000;
+constexpr int M = 20'000;
+void performance_test() {
+ timer t;
+ Graph<NoData> g(N);
+ g.erdosRenyi(M);
+ vector<edge> edges;
+ g.forEdges([&](int a, int b){
+ ll w1 = Random::integer<ll>(1, 1'000'000'000'000ll);
+ ll w2 = Random::integer<ll>(1, 1'000'000'000'000ll);
+ edges.push_back({a, b, w1});
+ edges.push_back({b, a, w2});
+ });
+
+ t.start();
+ auto got = bellmannFord(N, edges, 0);
+ t.stop();
+ hash_t hash = 0;
+ for (auto x : got) hash += x;
+ if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
+ cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+ stress_test();
+ performance_test();
+}