Ford Fulkerson

build residual graph

while(maximum flow has not been found):

search for augmenting path in residual graph from S to T

if augmenting path is found:

for each edge in path:

augment flow along forwards edge

decrement flow along backwards edge

else:

maximum flow has been found: break;

update residual graph

reveal edges in minimum cut

press play to begin.