This is a rather straight forward example of a maximum flow problem. So it can be formulated like this: Given a graph which represents a flow network where every edge has a capacity. Also given two ...

Add a description, image, and links to the dinic-algorithm topic page so that developers can more easily learn about it.