Network Flow II: Implementation of flow

Videos

Maximum flow Minimum Cut Algorithm

Exercises

1. Maximum flow and minimum cut

Minimum cut 4+4+4

S = {s, E}

T = {A, B, C, D, F, G, t}

2. Min-cut max-flow, Solve KT 7.3.