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 | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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 |
---|