#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(int LIM) {
	ll queries = 0;
	for (int tries = 0; tries < LIM; 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(10'000);
	if (!sanitize) stress_test(100'000);
	if (!sanitize) performance_test();
}