Max Flow Using the Ford-Fulkerson Method | Network Flow in Graph Theory

Explanation of how to find the maximum flow with the Ford-Fulkerson method Next video: https://youtu.be/Xu8jjJnwvxE Algorithms repository: https://github.com/williamfiset/algorithms#network-flow Video slides: https://github.com/williamfiset/Algorithms/tree/master/slides 0:00 Intro and motivation for maximum flow 2:42 Basics and definitions of network flow concepts 4:26 Augmenting paths, residual edges and the residual graph 8:05 Ford-Fulkerson with DFS example 9:49 Ford-Fulkerson time complexity 11:22 Faster network flow algorithms ====================================== Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: https://amzn.to/3cvMof5 A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: https://amzn.to/3wC2nix Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube: https://www.udemy.com/course/graph-theory-algorithms