complete dinic implementation
Closed this issue · 2 comments
vignesh-m commented
iteratively find blocking flow and subtract
maxflow/dinic.py
- construct residual graph after finding block flow
- iteratively find new flows
depends on #2
rahul13ramesh commented
Is multigraph a possible input, i.e. a pair of vertices have two edges between them in same direction?
I will work on it on 6/3. Also which branch should I make changes to?
vignesh-m commented
The multigraph issue is only in the input_graph thing so its fine.We will change it later if necessary.
About the branch, anything is fine