R7. Network Flow and Matching

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: ocw.mit.edu/6-0...
Instructor: Ling Ren
In this recitation, problems related to Network Flow and Matching are discussed.
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu

[@harrywang6792]

The deafening silence at 7:30 comforts me

[@junzhai1715]

the tricky part at 16:55 can be proved by contradiction:
Assume we have delta_f'(u) < delta_f(u), then u is in the set of vertices x that satisfy delta_f'(x) < delta_f(x). Meanwhile, we know delta_f'(u)

[@Ms-INFP]

I think the camera man may change its focus to the recitation content but not the TA...

[@chayapankhannabha655]

This guy is OG! TLDR; Ford-Fulkerson kind of had a bug, and Edmond-Karp is the fix. Most lectures and videos on network flow don't mention this point clear enough.

[@charlietian2996]

On 17:55 he didn't ask the question. If delta_f^'(v) is the smallest one, then v must be the successor of s. How can there be a u between s and v?

[@hellochii1675]

Who is this professor? I really like his teaching style. Does anyone know his name?

[@mitocw]

Graduate Student Ling Ren teaches this recitation. You can view the complete course here: ocw.mit.edu/6-046JS15.

[@Cat-vs7rc]

Just a TA for the course. This is a recitation session. The description says Ling Ren

[@Ullsteinus]

haha, funny

[@HafidzJazuli]

Ling Ren

[@notbnull]

@@DarkLordAli95 wtf man