Title

第32講 Maximum Flow Problem

Video

L31A

Syllabus

章節大綱

L32A
       00:00 Review
       01:00 Theorem ( The max-flow min-cut theorem)
  
 
 
L32B
       00:00 Theorem (cont. ) 
       07:15 Edmonds-Karp algorithm 
       19:00 Review of L31 and L32 
       20:00 Review of whole semester