Test (#4)

* update

* moved content in subdir

* rename file

* add test setup

* add test setup

* add github action

* automaticly test all cpp files

* timeout after 10s

* setulimit and dont zero memory

* test build pdf

* install latexmk

* update

* update

* ngerman

* fonts

* removed old code

* add first test

* added tests

* test in sorted order

* more tests

* simplified test

* more tests

* fix suffix tree

* fixes and improvements

* done ust lst directly

* fix swap

* add links to pdf

* fix constants

* add primorial

* add comment

* various improvements

* more tests

* added missing stuf

* more tests

* fix tests

* more tests

* more tests

* more tests

* fix recursion?

* test trie

* more tests

* only use python temporarily for listings

* only use python temporarily for listings

* more tests

* fix longestCommonSubstring

* more tests

* more tests

* made code more similiar

* fix?

* more tests

* more tests

* more tests

* add ahoCorasick test + limit 4GB stack size

* more tests

* fix test

* add additional test

* more tests

* more tests

* fix?

* better fix

* fix virtual tree

* more tests

* more tests

* recursive closest pair

* more tests

* decrease limit

* new tests

* more tests

* fix name

* more tests

* add test

* new test

* more tests

* more tests

* more tests

* more tests

* new test and content

* new code

* new code

* larger tests

* fix and test

* new test

* new test

* update pdf

* remove comments

* new test

* more tests

* more testcases

* more tests

* increased limit

* more tests

* more tests

* more tests

* new tests

* more tests

* shortened code

* new test

* add basic tests for bigint

* more tests

* removed old files

* new test

* ignore some files

* more auto more ccw

* fix test

* more tests

* fix

* new tests

* more tests

* more tests

* stronger test

* actually verify delaunay...

* more tests

* fix header

* more tests

* run tests parallel?

* test parralel?

* add --missing

* separate workflows

* test

* is the pdf checked?

* separate workflows

* fix workflow

* more workflows

---------

Co-authored-by: Yidi <noob999noob999@gmail.com>

1 files changed, 79 insertions, 0 deletions

diff --git a/test/graph/cycleCounting.cpp b/test/graph/cycleCounting.cpp
new file mode 100644
index 0000000..8e53aec
--- /dev/null
+++ b/test/graph/cycleCounting.cpp
@@ -0,0 +1,79 @@
+#include "../util.h"
+#include <datastructures/unionFind.cpp>
+#include <graph/cycleCounting.cpp>
+
+int naive(const vector<pair<int, int>>& edges, int n) {
+	int res = 0;
+	for (int i = 1; i < (1ll << sz(edges)); i++) {
+		vector<int> deg(n);
+		init(n);
+		int cycles = 0;
+		for (int j = 0; j < sz(edges); j++) {
+			if (((i >> j) & 1) != 0) {
+				auto [a, b] = edges[j];
+				deg[a]++;
+				deg[b]++;
+				if (findSet(a) != findSet(b)) {
+					unionSets(a, b);
+				} else {
+					cycles++;
+				}
+			}
+		}
+		bool ok = cycles == 1;
+		for (auto d : deg) ok &= d == 0 || d == 2;
+		if (ok) res++;
+	}
+	return res;
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (int tries = 0; tries < 50'000; tries++) {
+		int n = Random::integer<int>(1, 8);
+		int m = Random::integer<int>(0, min<int>(15, n*(n-1) / 2 + 1));
+
+		Graph<NoData, 0, 1, 1> g(n);
+		g.erdosRenyi(m);
+		vector<pair<int, int>> edges;
+		cycles cyc(n);
+		g.forEdges([&](int a, int b){
+			edges.emplace_back(a, b);
+			cyc.addEdge(a, b);
+		});
+
+		int expected = naive(edges, n);
+		int got = cyc.count();
+
+		if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
+		queries += n;
+	}
+	cerr << "tested random queries: " << queries << endl;
+}
+
+constexpr int N = 100;
+constexpr int M = 20;
+void performance_test() {
+	timer t;
+
+	Graph<NoData> g(N);
+	g.tree();
+	g.erdosRenyi(M);
+	cycles cyc(N);
+	g.forEdges([&](int a, int b){
+		cyc.addEdge(a, b);
+	});
+
+	t.start();
+	hash_t hash = cyc.count();
+	cerr << sz(cyc.base) << endl;
+	t.stop();
+
+	if (t.time > 1000) cerr << "too slow: " << t.time << FAIL;
+	cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+	stress_test();
+	performance_test();
+}