Introduction

In graph theory, a flow network is defined as a directed graph involving a source(S) and a sink(T) and several other nodes connected with edges. Each edge has an individual capacity which is the maximum limit of flow that edge could allow.

References

https://www.topcoder.com/community/competitive-programming/tutorials/maximum-flow-section-1/
https://www.hackerearth.com/practice/algorithms/graphs/maximum-flow/tutorial/
https://brilliant.org/wiki/edmonds-karp-algorithm/?subtopic=algorithms&chapter=flow-networks