From 8d11c6c8213f46f0fa19826917c255edd5d43cb1 Mon Sep 17 00:00:00 2001 From: mzuenni Date: Sun, 28 Jul 2024 22:54:40 +0200 Subject: 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 --- graph/minCostMaxFlow.cpp | 66 ------------------------------------------------ 1 file changed, 66 deletions(-) delete mode 100644 graph/minCostMaxFlow.cpp (limited to 'graph/minCostMaxFlow.cpp') diff --git a/graph/minCostMaxFlow.cpp b/graph/minCostMaxFlow.cpp deleted file mode 100644 index 14a222c..0000000 --- a/graph/minCostMaxFlow.cpp +++ /dev/null @@ -1,66 +0,0 @@ -constexpr ll INF = 1LL << 60; // Größer als der maximale Fluss. -struct MinCostFlow { - struct edge { - int to; - ll f, cost; - }; - vector edges; - vector> adj; - vector pref, con; - vector dist; - const int s, t; - ll maxflow, mincost; - - MinCostFlow(int n, int source, int target) : - adj(n), s(source), t(target) {}; - - void addEdge(int u, int v, ll c, ll cost) { - adj[u].push_back(sz(edges)); - edges.push_back({v, c, cost}); - adj[v].push_back(sz(edges)); - edges.push_back({u, 0, -cost}); - } - - bool SPFA() { - pref.assign(sz(adj), -1); - dist.assign(sz(adj), INF); - vector inqueue(sz(adj)); - queue queue; - dist[s] = 0; - queue.push(s); - pref[s] = s; - inqueue[s] = true; - while (!queue.empty()) { - int cur = queue.front(); queue.pop(); - inqueue[cur] = false; - for (int id : adj[cur]) { - int to = edges[id].to; - if (edges[id].f > 0 && - dist[to] > dist[cur] + edges[id].cost) { - dist[to] = dist[cur] + edges[id].cost; - pref[to] = cur; - con[to] = id; - if (!inqueue[to]) { - inqueue[to] = true; - queue.push(to); - }}}} - return pref[t] != -1; - } - - void extend() { - ll w = INF; - for (int u = t; pref[u] != u; u = pref[u]) - w = min(w, edges[con[u]].f); - maxflow += w; - mincost += dist[t] * w; - for (int u = t; pref[u] != u; u = pref[u]) { - edges[con[u]].f -= w; - edges[con[u] ^ 1].f += w; - }} - - void mincostflow() { - con.assign(sz(adj), 0); - maxflow = mincost = 0; - while (SPFA()) extend(); - } -}; -- cgit v1.2.3