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/hopcroftKarp.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/hopcroftKarp.cpp')
| -rw-r--r-- | graph/hopcroftKarp.cpp | 47 |
1 files changed, 0 insertions, 47 deletions
diff --git a/graph/hopcroftKarp.cpp b/graph/hopcroftKarp.cpp deleted file mode 100644 index c1f5d1c..0000000 --- a/graph/hopcroftKarp.cpp +++ /dev/null @@ -1,47 +0,0 @@ -vector<vector<int>> adj; -// pairs ist der gematchte Knoten oder -1 -vector<int> pairs, dist, ptr; - -bool bfs(int l) { - queue<int> q; - for(int v = 0; v < l; v++) { - if (pairs[v] < 0) {dist[v] = 0; q.push(v);} - else dist[v] = -1; - } - bool exist = false; - while(!q.empty()) { - int v = q.front(); q.pop(); - for (int u : adj[v]) { - if (pairs[u] < 0) {exist = true; continue;} - if (dist[pairs[u]] < 0) { - dist[pairs[u]] = dist[v] + 1; - q.push(pairs[u]); - }}} - return exist; -} - -bool dfs(int v) { - for (; ptr[v] < sz(adj[v]); ptr[v]++) { - int u = adj[v][ptr[v]]; - if (pairs[u] < 0 || - (dist[pairs[u]] > dist[v] && dfs(pairs[u]))) { - pairs[u] = v; pairs[v] = u; - return true; - }} - return false; -} - -int hopcroft_karp(int l) { // l = #Knoten links - int ans = 0; - pairs.assign(sz(adj), -1); - dist.resize(l); - // Greedy Matching, optionale Beschleunigung. - for (int v = 0; v < l; v++) for (int u : adj[v]) - if (pairs[u] < 0) {pairs[u] = v; pairs[v] = u; ans++; break;} - while(bfs(l)) { - ptr.assign(l, 0); - for(int v = 0; v < l; v++) { - if (pairs[v] < 0) ans += dfs(v); - }} - return ans; -} |