diff options
| author | mzuenni <mzuenni@users.noreply.github.com> | 2024-07-28 22:54:40 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-07-28 22:54:40 +0200 |
| commit | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (patch) | |
| tree | 96d75baff33d5a04b5a60f1a41f514a26c716874 /graph/stoerWagner.cpp | |
| parent | 8c33b4e0d3030cfed17fc64b4fe41133339f6d87 (diff) | |
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>
Diffstat (limited to 'graph/stoerWagner.cpp')
| -rw-r--r-- | graph/stoerWagner.cpp | 53 |
1 files changed, 0 insertions, 53 deletions
diff --git a/graph/stoerWagner.cpp b/graph/stoerWagner.cpp deleted file mode 100644 index 97e667a..0000000 --- a/graph/stoerWagner.cpp +++ /dev/null @@ -1,53 +0,0 @@ -struct Edge { - int from, to; - ll cap; -}; - -vector<vector<Edge>> adj, tmp; -vector<bool> erased; - -void merge(int u, int v) { - tmp[u].insert(tmp[u].end(), all(tmp[v])); - tmp[v].clear(); - erased[v] = true; - for (auto& vec : tmp) { - for (Edge& e : vec) { - if (e.from == v) e.from = u; - if (e.to == v) e.to = u; -}}} - -ll stoer_wagner() { - ll res = INF; - tmp = adj; - erased.assign(sz(tmp), false); - for (int i = 1; i < sz(tmp); i++) { - int s = 0; - while (erased[s]) s++; - priority_queue<pair<ll, int>> pq; - pq.push({0, s}); - vector<ll> con(sz(tmp)); - ll cur = 0; - vector<pair<ll, int>> state; - while (!pq.empty()) { - int c = pq.top().second; - pq.pop(); - if (con[c] < 0) continue; //already seen - con[c] = -1; - for (auto e : tmp[c]) { - if (con[e.to] >= 0) {//add edge to cut - con[e.to] += e.cap; - pq.push({con[e.to], e.to}); - cur += e.cap; - } else if (e.to != c) {//remove edge from cut - cur -= e.cap; - }} - state.push_back({cur, c}); - } - int t = state.back().second; - state.pop_back(); - if (state.empty()) return 0; //graph is not connected?! - merge(state.back().second, t); - res = min(res, state.back().first); - } - return res; -} |