[基础算法] 一个Ford-Fulkerson算法的例子

Example:
 

Initialized:

Augmenting path:s→a→b→t,excess capacity:min(4, 3, 5) = 3
f(G) = 3:

Augmenting path:s→a→t,excess capacity:min(1, 5) = 1
f(G) = 4:

Augmenting path:s→c→d→t,excess capacity:min(6, 4, 4) = 4
f(G) = 8:
 

Final result: