 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
请问谁实现过/懂Hopcroft-Karp算法么？我不大懂是怎么在O(m)找出maximal vertex disjoint set的augmenting path的 down到一个pdf上的讲法和SRbGa的讲法又差距比较大 请问谁能来比较详细的阐述一下么？ 谢谢：） Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
