Ford-Fulkerson Method

Facts The Ford-Fulkerson methodΒ  is iterative This method depends on three ideas: Augmenting paths Residual networks Cuts Simplified Pseudo-code: initialize flow f to 0 while there exist an augmenting path p do augmented flow f along p return f Augmenting Paths An augmenting path is a simple path from source to sing in the residual […]

Share