0
$\begingroup$

I have network flow $G=(V,E,s,t)$ where every edge capacity is $\sqrt{2}$ except one edge, which capacity is $2$. I need to describe efficient algorithm to find max flow. If all capacities where exactly the same, I could use dinic on the same network with capacities of 1 and at the end multiply the max flow in $\sqrt{2}$, but how can I deal with the problematic edge of capacity $2$? thanks!

$\endgroup$
0

Browse other questions tagged or ask your own question.