Solutions to Homework Assignment, Week 6 5 4)



Download 125.45 Kb.
Page1/3
Date conversion02.05.2018
Size125.45 Kb.
  1   2   3
Solutions to Homework Assignment, Week 6
5 (5.4)

Augmenting path: 1258 of capacity 5



Augmenting Path: 1368 of capacity 4



Augmenting Path: 1478 of capacity 3



Augmenting Path: 1268 of capacity 2


Augmenting Path: 1475268 of capacity 2


The sink cannot be labeled, therefore we have the maximum flow f=16. Minimum capacity cut: (2,6),(3,6),(5,8),(7,8) of capacity 16.


Maximal Flow in the network:

  1   2   3


The database is protected by copyright ©ininet.org 2016
send message

    Main page