Maximum Flow Problem ShusenWang 图数据结构和算法课程笔记 Slides Maximum Flow Problem Description Naive Algorithm Residual = Capacity - FlowLeft: Original GraphRight: Residual Graph - Bottleneck capa