Lecture Design and Analysis of Algorithms - Lecture 14A: Network flow & applications. The following will be discussed in this chapter: max-flow min-cut theorem, edmonds karp algorithm, flow integrality, applications. | Lecture Design and Analysis of Algorithms - Lecture 14A: Network flow & applications