Lecture 24: The Ford-Fulkerson Algorithm for Maximum Flow

This lecture introduces the famous Ford-Fulkerson algorithm to find maximum flows. It is dependent on incrementally adding flows using augmenting paths in residual graphs until such paths can't be found. The instruction language is Arabic, however, all material, slides, concepts, definitions, examples, etc., are all given in English.