Problema de flujo máximo p1/3

Network flow, Ford-Fulkerson algorithm, max-flow-min-cut theorem