Let's assume we have some network G, and for edges e_1, e_2 and e_n, there is constraint that they should have equal amount of flow. Given this constraint I want to find max flow.
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Network Flow with equal flows on given edges constraint.
Let's assume we have some network G, and for edges e_1, e_2 and e_n, there is constraint that they should have equal amount of flow. Given this constraint I want to find max flow.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
Tokyo_Drift | 2022-12-18 10:48:47 | 49 | Tiny change: '{e_2} = ..f_{e_k}$' -> '{e_2} = ...f_{e_k}$' | |
en2 |
![]() |
Tokyo_Drift | 2022-12-18 10:41:18 | 231 | Tiny change: 'for edges e_1, e_2 and e_n, there is' -> 'for edges $e_1$, $e_2$ and $e_n$, there is' (published) | |
en1 |
![]() |
Tokyo_Drift | 2022-12-18 10:36:00 | 235 | Initial revision (saved to drafts) |
Name |
---|