Here it is written that Dinic's algorithm can run in O(min{V3 / 2, E1 / 2}E) time for graphs with unit capacity edges. Do I need to modify dinic's code in order to achieve that time bound? If yes can anyone give me an example code.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Here it is written that Dinic's algorithm can run in O(min{V3 / 2, E1 / 2}E) time for graphs with unit capacity edges. Do I need to modify dinic's code in order to achieve that time bound? If yes can anyone give me an example code.
Name |
---|
You don't need to do anything, just make sure that the edges are with unit (or equal) capacities.