I'm studying Edmond's maximum matching algorithm and will write the code of this algorithm. Does anyone know where to verify?
→ Pay attention
Before contest
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
3 days
Register now »
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
3 days
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/14/2026 20:58:18 (g2).
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.me/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! :)