[[Graph and Networking Algoriithms]] Max-flow algorithm
- find an augmenting path
- compute the bottleneck capacity
- augment each edge and the total flow
**The graph must remain in equilibrium Usually is used depth-first alg to finish the iterations. ** ![[Frblp.jpg]]
#algorithms #networking #maxflow