最大二分匹配算法的时间复杂度是多少？
What is time complexity of maximum bipartitie matching algorithm?
这是经典问题：- "There are M job applicants and N jobs. Each applicant has a subset of jobs that he/she is interested in. Each job opening can only accept one applicant and a job applicant can be appointed for only one job. Find an assignment of jobs to applicants in such that as many applicants as possible get jobs."
我正在使用以下代码和算法来解决问题：https://www.geeksforgeeks.org/maximum-bipartite-matching/
这个算法的时间复杂度是多少？
根据 this 维基百科文章，Ford & Fulkerson 的算法的运行时复杂度为 O(|E|f)，其中 |E| 是输入边集的基数。请注意，此运行时界限取决于最优值并且是伪多项式。
这是经典问题：- "There are M job applicants and N jobs. Each applicant has a subset of jobs that he/she is interested in. Each job opening can only accept one applicant and a job applicant can be appointed for only one job. Find an assignment of jobs to applicants in such that as many applicants as possible get jobs."
我正在使用以下代码和算法来解决问题：https://www.geeksforgeeks.org/maximum-bipartite-matching/
这个算法的时间复杂度是多少？
根据 this 维基百科文章，Ford & Fulkerson 的算法的运行时复杂度为 O(|E|f)，其中 |E| 是输入边集的基数。请注意，此运行时界限取决于最优值并且是伪多项式。