blue__legend's blog

Implementation of Min Cost Max flow
By blue__legend, history, 9 years ago, In English

Need a neat implementation of Min Cost-Max Flow algorithm as I am not able to understand e-maxx.ru . And my code is too buggy to debug. Any help would be appreciated.

  • Vote: I like it
  • +2
  • Vote: I do not like it

Comments Comments (9)
| Write comment?
»
9 years ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

Hello! In this notebook has the implementation that I usually use, I hope it helps :)

https://github.com/Gabriel123Duarte/maratona-final/blob/master/Notebook/100%5Eo.pdf

→ Reply
»
9 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

I hope this help you

http://ideone.com/jQqO6I

→ Reply
»
9 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

I know you got some codes already, but I thought mine could be helpful, too. Code, which is actually a solution to this problem.

→ Reply
  • »
    »
    9 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    hi thanks for the code can you also tell me the running time of code

    → Reply
    • »
      »
      »
      9 years ago, hide # ^ |
       
      Vote: I like it +1 Vote: I do not like it

      I am sorry but I don't remember which article I learnt this from and I can't calculate the complexity myself. I only remember that for the assignment problem it works in O(N3 * logN). If you actually meant running time, it's around 250 ms.

      → Reply
»
9 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

i have seen implementation of mcmf with dijkstra, spfa and bellman ford. and most of them use spfa. why dijkstra is not used much despite having better complexity??

→ Reply