Forda-Falkersona algoritms

1. S -> x1 – max. Plūsma 10/10
a. X1 -> x2 – 10/15
2. S -> x3 – max. Plūsma 17/30
a. X3 ->x2 12/12
b. X3 -< t 5/5
c. X3 -> x1 8/8
d. X2 -> t 7/7
e. X2 -> t 15/15
3. Maksimāla plūsma no s uz t ir 27

0. Visām orgrafa G virsotnēm piešķiram iezīmi 0: >(хį) = 0 (i = х1,х2, ... ,
1. Tā kā Г-(х1) = {s}, tad
>(x1)=max{>(s)+ w(s; x1)} = max{0+10} = max{10} = 10;

2. Tā kā Г(x2) = {s; x1}, tad
>(x2) = max{>(s) + w(s; x2); >(x1)+ w(x1; x2)} =
= max{0 + 42} = max{42} = 42;
…