From f8f53c2f9e63f0ac89b67dc4d413ec9a76415a73 Mon Sep 17 00:00:00 2001
From: Gloria Mundi <gloria@gloria-mundi.eu>
Date: Sat, 7 Jun 2025 19:42:50 +0200
Subject: adapt Tutte matching to new Gauss, and remove some global variables

---
 test/graph/blossom.cpp  | 10 +++++-----
 test/graph/matching.cpp | 18 +++++++++---------
 2 files changed, 14 insertions(+), 14 deletions(-)

(limited to 'test/graph')

diff --git a/test/graph/blossom.cpp b/test/graph/blossom.cpp
index 714b029..0add7e1 100644
--- a/test/graph/blossom.cpp
+++ b/test/graph/blossom.cpp
@@ -1,6 +1,6 @@
 #include "../util.h"
 namespace tutte {
-void gauss(int n, ll mod);
+vector<int> gauss(vector<vector<ll>> &mat);
 #include <graph/matching.cpp>
 #include <math/shortModInv.cpp>
 #include <math/lgsFp.cpp>
@@ -15,20 +15,20 @@ void stress_test() {
 
 		GM blossom(n);
 		srand(Random::rng());
-		tutte::adj.assign(n, {});
+		vector<vector<int>> adj(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);
+			adj[a].push_back(b);
+			adj[b].push_back(a);
 
 			blossom.adj[a].push_back(b);
 			blossom.adj[b].push_back(a);
 		});
 
 		ll got = blossom.match();
-		ll expected = tutte::max_matching();
+		ll expected = tutte::max_matching(adj);
 
 		vector<bool> seen(n);
 		ll got2 = 0;
diff --git a/test/graph/matching.cpp b/test/graph/matching.cpp
index b8fbc6c..9e3ad85 100644
--- a/test/graph/matching.cpp
+++ b/test/graph/matching.cpp
@@ -1,6 +1,6 @@
 #include "../util.h"
 namespace tutte {
-void gauss(int n, ll mod);
+vector<int> gauss(vector<vector<ll>> &mat);
 #include <graph/matching.cpp>
 #include <math/shortModInv.cpp>
 #include <math/lgsFp.cpp>
@@ -15,19 +15,19 @@ void stress_test() {
 
 		GM blossom(n);
 		srand(Random::rng());
-		tutte::adj.assign(n, {});
+		vector<vector<int>> adj(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);
+			adj[a].push_back(b);
+			adj[b].push_back(a);
 
 			blossom.adj[a].push_back(b);
 			blossom.adj[b].push_back(a);
 		});
 
-		ll got = tutte::max_matching();
+		ll got = tutte::max_matching(adj);
 		ll expected = blossom.match();
 
 		if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
@@ -43,14 +43,14 @@ void performance_test() {
 	Graph<NoData> g(N);
 	g.erdosRenyi(M);
 	srand(Random::rng());
-	tutte::adj.assign(N, {});
+	vector<vector<int>> adj(N);
 	g.forEdges([&](int a, int b){
-			tutte::adj[a].push_back(b);
-			tutte::adj[b].push_back(a);
+			adj[a].push_back(b);
+			adj[b].push_back(a);
 	});
 
 	t.start();
-	hash_t hash = tutte::max_matching();
+	hash_t hash = tutte::max_matching(adj);
 	t.stop();
 	if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
 	cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
-- 
cgit v1.2.3