Source code for Maximum flow in O(mn + something)
The max flow has been solved in around O(m*n) where m is number of nodes
and n is number of edges by King-Rao-Tarjan or Orlin. Does any of you know
where to find the source code of the implementation of the algorithm? I
googled and it didn't help. I code in Java, but any language should be
fine for now. Thanks.
No comments:
Post a Comment