Ford-Fulkerson and Edmonds-Karp - Flow Networks - Algorithms Part 12
In this lecture, we introduce flow networks and discuss the primary problem associated with them: the max flow problem. In this context, we discuss the max-flow min-cut theorem and how it can be used to design algorithms to compute the maximum flow such as Ford-Fulkerson and Edmonds-Karp.
Timestamps:
00:00 Introduction
00:25 Flow Networks
02:38 Max-Flow Min-Cut Theorem
05:55 Ford-Fulkerson Algorithm
07:30 Edmonds-Karp Algorithm
08:22 Conclusion
#maxflow #flownetwork #graphtheory #edmondskarp #fordfulkerson #algorithms #timecomplexity #computerscience #education #discretemathematics #networks