Maximum Bipartite Matching

Revision en1, by gXa, 2017-01-29 18:20:03

Please tell the complexity of http://www.geeksforgeeks.org/maximum-bipartite-matching/?

And if we use directly Ford-Fulkerson Algorithm, will it be better?

Tags bipartite matching, ford fulkerson

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English gXa 2017-01-29 18:20:28 1 Tiny change: '-matching/?\n\nAnd i' -> '-matching/ ?\n\nAnd i'
en1 English gXa 2017-01-29 18:20:03 184 Initial revision (published)