I'm studying Edmond's maximum matching algorithm and will write the code of this algorithm. Does anyone know where to verify?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 17:27:14 (i1).
Desktop version, switch to mobile version.
Supported by
http://acm.timus.ru/problem.aspx?space=1&num=1099
Thank you very much!
This problem.
Good day to you,
I've collected a few problems, in which I used Max-matching (HK) so here is mine list
http://www.lightoj.com/volume_showproblem.php?problem=1171
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4851
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=657&page=show_problem&problem=4899
http://codeforces.net/gym/100820 /*PROBLEM A — Airport*/
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=441&page=show_problem&problem=3975
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4696
https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2079
http://www.spoj.com/problems/MATCHING/
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3235
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=602&page=show_problem&problem=4406
http://www.spoj.com/problems/ADAPATH/
http://www.spoj.com/problems/ADACITY/
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=441&page=show_problem&problem=3994
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3642
Hope it will help {and hope I didn't make any mistake in collecting}!
Good Luck & Have nice day
I think he means matching in general graph. It is O(N^3) as far as I know and might be too slow for some of the problems which you have solved with HK.
Edit: Okay, he means Edmond's algorithm. At least this is O(N^3), right? :D
there are couple of
matching algorithms. For example, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.2804&rep=rep1&type=pdf
Wow, thank you! :)