Flow related doubt

Правка en1, от Zenkai, 2019-03-06 18:49:25

Is there a well known trick in max-flow, in which after entering a node or edge the flow through it multiplies by some constant k, which can be different for each node. Something like described in the image below.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Zenkai 2019-03-06 18:54:34 81 Tiny change: 'Is there a' -> '![ ](https://mirror.codeforces.com/03255b/graph (1).png)\n\nIs there a'
en1 Английский Zenkai 2019-03-06 18:49:25 231 Initial revision (published)