Find a maximumvalue flow from s to t on the following graph

Find a maximum-value flow from s to t on the following graph. Show your augmenting paths, partial flows, and residual graphs. Also show an s, t-cut that has capacity equal to your final flow’s value to verify the correctness of your answer.

Solution

maximum value flow from s to t is 21

path of flow: s->b->c->e->d->t

where

s->b =8

b->c=6

c->e=4

e->d=1

d->t=2

total=8+6+4+1+2=21