network flows theory algorithms and applications by
ork along which additional flow can be pushed. Maximum Flow: The greatest feasible flow from \( s \) to \( t \). Fundamental Algorithms in Network Flows Several classical algorithms have been developed to solve maximum flow problems