DINIC's MAXFLOW
Tool for Finding max-flow and min-cut of a network, and its visualization
Uses Dinic Max-flow algorithm for the same. Run time of Dinic's:
O(EV^2)
Add vertice
From
To
Capacity
Add Edge
Maxflow
Undo Flow
Cricket game application of Max flow >