Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Weighted bipartite matching

Revision en2, by u1804011, 2021-05-08 17:55:36

Can we use dijkstra algorithm to find maximum bipartite matching with minimum cost? If we can,how??

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English u1804011 2021-05-08 17:55:36 17 Tiny change: 'um cost?\n\n' -> 'um cost?\nIf we can,how??\n\n'
en1 English u1804011 2021-05-08 17:54:48 114 Initial revision (published)