Abstract
In the maximum flow problem, the goal is to determine how to send the largest possible amount of flow between two vertices of a network that have capacities in the arcs, so that no capacity is exceeded and no flow is lost. This problem is very relevant because it is useful in modeling a wide variety of other problems.This project has as objectives the study of algorithms for the maximum f…