Max Flow | Ford-Fulkerson Algorithm Explained and Implemented in Java | Graph Theory | Geekific

Discord Community: https://discord.gg/dK6cB24ATp GitHub Repository: https://github.com/geekific-official/ The subject of this video is an algorithm that I personally find extremely fascinating because of its numerous applications. These applications range between airline scheduling, survey design, image segmentation, networking and many more. Today, we explain and implement the Ford-Fulkerson algorithm. Timestamps: 00:00 Introduction 00:28 Ford-Fulkerson's Algorithm Explained 03:30 Ford-Fulkerson's Algorithm Implemented 07:46 Putting our Code to the Test 08:14 Thanks for Watching! If you found this video helpful, check other Geekific uploads: - Object-Oriented Programming Fundamentals: https://youtu.be/Vfk6sExu8-4 - SOLID Principles and Best Practices: https://youtu.be/HoA6aZPR5K0 - Recursion Made Simple, Recursive Methods: https://youtu.be/r8KJ2AJWkHs - Use-Case and Sequence Diagrams: https://youtu.be/el501qi0KtI - Graphs, The Fundamentals: https://youtu.be/UUuFT5K6zrI - Trees Compared and Visualized, BST vs AVL vs RedBlack vs Splay vs Heaps: https://youtu.be/hmSFuM2Tglw - Dijkstra's Algorithm Explained and Implemented in Java: https://youtu.be/BuvKtCh0SKk #Geekific #FordFulkerson #GraphTheory #Graphs #Java