The maximum flow problem is an optimisation problem in graph theory that focuses on finding the maximum amount of flow that can be sent from a source node to a sink node through a Flow Network.
This can be solved with the Ford-Fulkerson Method, .e.g by using the Edmonds-Karp Algorithm.