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/havelHakimi.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/havelHakimi.cpp')
| -rw-r--r-- | graph/havelHakimi.cpp | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/graph/havelHakimi.cpp b/graph/havelHakimi.cpp deleted file mode 100644 index cbd6991..0000000 --- a/graph/havelHakimi.cpp +++ /dev/null @@ -1,18 +0,0 @@ -vector<vector<int>> havelHakimi(const vector<int>& deg) { - priority_queue<pair<int, int>> pq; - for (int i = 0; i < sz(deg); i++) { - if (deg[i] > 0) pq.push({deg[i], i}); - } - vector<vector<int>> adj; - while (!pq.empty()) { - auto [degV, v] = pq.top(); pq.pop(); - if (sz(pq) < degV) return {}; //impossible - vector<pair<int, int>> todo(degV); - for (auto& e : todo) e = pq.top(), pq.pop(); - for (auto [degU, u] : todo) { - adj[v].push_back(u); - adj[u].push_back(v); - if (degU > 1) pq.push({degU - 1, u}); - }} - return adj; -} |