The Ford-Fulkerson Algorithm

In this video, I discuss the Ford-Fulkerson algorithm, which can be used to solve the Max Flow problem. I don't discuss how to code the algorithm, though. There are many resources online that do so. Instead, care is taken to intuitively describe the use of back-edges and the residual graph, which are key to understanding the algorithm's method for correcting suboptimal path choices. 00:00 - Intro 01:55 - Problem Definition 02:44 - Naive (incorrect) approach 04:25 - Issues with naive approach 06:26 - Back-edges 06:47 - Revised (correct) approach 11:35 - Summary