Алгоритмы и структуры данных 10. Потоки начало

簡介：

00:00 - The lecture begins with an introduction to finding a maximum independent set and minimum vertex cover. 13:10 - We then discuss flows, defining networks and flows. 24:25 - The concept of residual networks and the maximum flow criterion is explained. 31:30 - A theorem stating that the value of a cut equals the value of a flow is presented. 38:50 - The Ford–Fulkerson theorem is introduced. 50:30 - The Ford–Fulkerson algorithm is described. 59:45 - The Edmonds–Karp algorithm is covered. 1:01:45 - Proof of lemma 1 is provided. 1:14:30 - Proof of lemma 2 is presented.