Capacities are shown in the circles.

Start from the feasible flow shown

v2
10 in blue and find the maximum flow
3
7 10 from 𝑠 to 𝑡.
9
s 7
t At each iteration choose vertex vi
v1
10 3
v3
10 6
v5
labeled and not explored with
minimum index.
10
10 10
10 0
8
v4

0
 Costs are shown in blue.
2 5 Find the minimum spanning tree.
v1 v2 v4
1
9
3

3
v3 v5