how to use maximum network flow to solve this?

115 Views Asked by At

suppose we are given a network which Node A sends 2 packet to Node B and for security reasons we want these two packets get different paths to reach Node B.How can I use Maximum Network Flow to determine is it possible in a given Network?

I guess I should consider all capacities one and if two packets have to pass through common edge the maximum Network Flow will be 1 and the given Network won't be able to do this task else it is capable.But I'm not sure is it true to consider a Capacity for all edges?

0

There are 0 best solutions below