Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Looking for OJ to test MCMF and/or Hungarian method implementations

Revision en1, by farnasirim, 2018-12-07 19:40:38

Hi.

I did some testing using my own randomly generated IO, but was looking for a hosted one to be sure. If you happen to know of any classical weighted assignment problems/min-cost max-flow problems in an OJ, please let me know in the comments.

So far I know about this one: https://www.spoj.com/problems/BABY/

Best.

Tags hungarian, min cost max flow, assignment problem

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English farnasirim 2018-12-07 19:40:38 433 Initial revision (published)